{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,28]],"date-time":"2026-09-28T21:21:21Z","timestamp":1790630481239,"version":"4.1.0"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"name":"AIDyNet"},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-13-BS02- 0007"],"award-info":[{"award-number":["ANR-13-BS02- 0007"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-11-LABX-0031-01"],"award-info":[{"award-number":["ANR-11-LABX-0031-01"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We study the complexity of decomposing a graph by means of clique separators. This common algorithmic tool, first introduced by Tarjan, allows one to cut a graph into smaller pieces, and so it can be applied to preprocess the graph in the computation of optimization problems. However, the best-known algorithms for computing a decomposition have respective ${\\cal O}(nm)$-time and ${\\cal O}(n^{(3+\\alpha)\/2}) = o(n^{2.69})$-time complexity with $\\alpha &lt; 2.3729$ being the exponent for matrix multiplication. Such running times are prohibitive for large graphs. Here we prove that for every graph $G$, a decomposition can be computed in ${\\cal O}(T(G) + \\min\\{n^{\\alpha},\\omega^2 n\\})$-time with $T(G)$ and $\\omega$ being, respectively, the time needed to compute a minimal triangulation of $G$ and the clique-number of $G$. In particular, it implies that every graph can be decomposed by clique separators in ${\\cal O}(n^{\\alpha}\\log n)$-time. Based on prior work from Kratsch et al., we prove in addition that decomposing a graph by clique-separators is as least as hard as triangle detection. Therefore, the existence of any $o(n^{\\alpha})$-time algorithm for this problem would be a significant breakthrough in the algorithmic field. Finally, our main result implies that planar graphs, bounded-treewidth graphs, and bounded-degree graphs can be decomposed by clique separators in linear or quasi-linear time.<\/jats:p>","DOI":"10.1137\/16m1059837","type":"journal-article","created":{"date-parts":[[2018,3,27]],"date-time":"2018-03-27T12:33:35Z","timestamp":1522154015000},"page":"682-694","source":"Crossref","is-referenced-by-count":9,"title":["Revisiting Decomposition by Clique Separators"],"prefix":"10.1137","volume":"32","author":[{"given":"David","family":"Coudert","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillaume","family":"Ducoffe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2018,3,27]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1002\/net.21631"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.11.018"},{"key":"atypb3","first-page":"15","volume":"2011","author":"Berry A.","year":"2011","journal-title":"France"},{"key":"atypb4","unstructured":"A. Berry, R. Pogorelcnik, and G. Simonet,\n                      Efficient Clique Decomposition of a Graph into its Atom Graph\n                      , Technical report hal-00678702, HAL, 2010."},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.3390\/a3020197"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.030"},{"key":"atypb7","first-page":"7","author":"Berry A.","year":"2012","journal-title":"Springer"},{"key":"atypb8","first-page":"1","author":"Blair J.","year":"1993","journal-title":"New York"},{"key":"atypb9","first-page":"1","author":"Bodlaender H. L.","year":"2006","journal-title":"Norway"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.017"},{"key":"atypb11","doi-asserted-by":"crossref","unstructured":"J. A. Bondy and U. S. R. Murty,\n                      Graph Theory\n                      , Grad. Texts in Math., Springer, New York, 2008.","DOI":"10.1007\/978-1-84628-970-5"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.03.005"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480193253415"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1137\/15M1039821"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(98)00394-X"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.06.001"},{"key":"atypb17","first-page":"20","author":"Cohen N.","year":"2015","journal-title":"ACM J. Exp. Algorithmics"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.09.018"},{"key":"atypb19","first-page":"210","author":"Dahlhaus E.","year":"1998","journal-title":"New York"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00331-0"},{"key":"atypb21","unstructured":"E. Dahlhaus, M. Karpinski, and N. B. Novick,\n                      Fast parallel algorithms for the clique separator decomposition\n                      , in Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, 1990, SIAM, pp. 244-251."},{"key":"atypb22","first-page":"883","author":"Didi Biha M.","year":"2007","journal-title":"New York"},{"key":"atypb23","first-page":"71","author":"Dirac G.","year":"1961","journal-title":"New York"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.060"},{"key":"atypb25","first-page":"1419","author":"Fomin F. V.","year":"2017","journal-title":"SIAM"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(74)90094-X"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(77)90030-9"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90088-7"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.003"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445010"},{"key":"atypb31","first-page":"653","author":"Impagliazzo R.","year":"1998","journal-title":"IEEE"},{"key":"atypb32","doi-asserted-by":"crossref","first-page":"433","DOI":"10.3233\/ISI-2007-00319","volume":"7","author":"Kaba B.","year":"2007","journal-title":"Silico Biol."},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441435"},{"key":"atypb34","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2005.12.009"},{"key":"atypb35","first-page":"296","author":"Le Gall F.","year":"2014","journal-title":"ACM"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(93)90510-Z"},{"key":"atypb37","unstructured":"B. Mohar and C. Thomassen,\n                      Graphs on Surfaces\n                      , Vol. 2, The Johns Hopkins University Press, Baltimore, MD, 2001."},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(70)90282-9"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1137\/0205021"},{"key":"atypb40","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90051-2"},{"key":"atypb41","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"atypb42","first-page":"1671","author":"Vassilevska Williams V.","year":"2015","journal-title":"SIAM"},{"key":"atypb43","first-page":"645","author":"Vassilevska Williams V.","year":"2010","journal-title":"IEEE"},{"key":"atypb44","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(81)90072-7"},{"key":"atypb45","doi-asserted-by":"crossref","unstructured":"H. Yaghi and H. Krim,\n                      Probabilistic graph matching by canonical decomposition\n                      , in Proceedings of the 15th IEEE International Conference on Image Processing (ICIP), 2008, pp. 2368-2371.","DOI":"10.1109\/ICIP.2008.4712268"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/16M1059837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:54:20Z","timestamp":1787316860000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/16M1059837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1137\/16M1059837"],"URL":"https:\/\/doi.org\/10.1137\/16m1059837","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1]]}}}