{"id":"https://openalex.org/W2794549149","doi":"https://doi.org/10.1137/16m1059837","title":"Revisiting Decomposition by Clique Separators","display_name":"Revisiting Decomposition by Clique Separators","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2794549149","doi":"https://doi.org/10.1137/16m1059837","mag":"2794549149"},"language":"en","primary_location":{"id":"doi:10.1137/16m1059837","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1059837","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020955386","display_name":"David Coudert","orcid":"https://orcid.org/0000-0002-3306-8314"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"David Coudert","raw_affiliation_strings":["COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"COATI - Combinatorics, Optimization and Algorithms for Telecommunications (2004 route des Lucioles BP 93 F-06902 Sophia Antipolis (France) - France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[{"id":"https://openalex.org/I141595442","display_name":"University of Bucharest","ror":"https://ror.org/02x2v6p15","country_code":"RO","type":"education","lineage":["https://openalex.org/I141595442"]},{"id":"https://openalex.org/I4210114681","display_name":"National Institute for Research and Development in Informatics - ICI Bucharest","ror":"https://ror.org/028rq5v79","country_code":"RO","type":"facility","lineage":["https://openalex.org/I4210114681"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Guillaume Ducoffe","raw_affiliation_strings":["ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)","ICUB - Research Institute of the University of Bucharest (36-46 Bd. M. Kogalniceanu, 5th District, 050107, Bucharest - Romania)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ICI - National Institute for Research and Development in Informatics [Bucharest] (8-10, Mare\u015fal Averescu, 011455, Bucharest - Romania)","institution_ids":["https://openalex.org/I4210114681"]},{"raw_affiliation_string":"ICUB - Research Institute of the University of Bucharest (36-46 Bd. M. Kogalniceanu, 5th District, 050107, Bucharest - Romania)","institution_ids":["https://openalex.org/I141595442"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3793,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.61665729,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"32","issue":"1","first_page":"682","last_page":"694"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.804246187210083},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.7669072151184082},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7366829514503479},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5377521514892578},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48965197801589966},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4715067446231842},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.4427200257778168},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4379673898220062},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4232480525970459},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.41292959451675415},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.30569732189178467},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.24393445253372192},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.19522196054458618},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.17218491435050964},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.1090669333934784}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.804246187210083},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.7669072151184082},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7366829514503479},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5377521514892578},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48965197801589966},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4715067446231842},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4427200257778168},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4379673898220062},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4232480525970459},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.41292959451675415},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.30569732189178467},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.24393445253372192},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.19522196054458618},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.17218491435050964},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.1090669333934784},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/16m1059837","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1059837","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01753324v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01753324","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2018, 32 (1), pp.682 - 694. &#x27E8;10.1137/16M1059837&#x27E9;","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1761114125","display_name":null,"funder_award_id":"ANR-11-LABX-0031-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G3717274260","display_name":"Forbidden Structures","funder_award_id":"ANR-13-BS02-0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G4847901217","display_name":"R\u00e9seau orient\u00e9 utilisateur","funder_award_id":"ANR-11-LABX-0031","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G991657511","display_name":null,"funder_award_id":"ANR-13-BS02- 0007","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1499093134","https://openalex.org/W1935074713","https://openalex.org/W1965381228","https://openalex.org/W1978452004","https://openalex.org/W1981917097","https://openalex.org/W1984781387","https://openalex.org/W1991410678","https://openalex.org/W1991477862","https://openalex.org/W2013949481","https://openalex.org/W2017793597","https://openalex.org/W2027502367","https://openalex.org/W2037106315","https://openalex.org/W2038865230","https://openalex.org/W2044124066","https://openalex.org/W2062210818","https://openalex.org/W2064343909","https://openalex.org/W2066867008","https://openalex.org/W2071628652","https://openalex.org/W2072082202","https://openalex.org/W2076340107","https://openalex.org/W2086119402","https://openalex.org/W2091254185","https://openalex.org/W2118348286","https://openalex.org/W2126464568","https://openalex.org/W2176807532","https://openalex.org/W2567413373","https://openalex.org/W2601439810"],"related_works":["https://openalex.org/W3037533092","https://openalex.org/W1480846237","https://openalex.org/W1605572092","https://openalex.org/W2040405987","https://openalex.org/W2076819776","https://openalex.org/W1553017086","https://openalex.org/W31595256","https://openalex.org/W1977623074","https://openalex.org/W4292770223","https://openalex.org/W2409344144"],"abstract_inverted_index":{"We":[0],"study":[1],"the":[2,38,41,47,69,107,118,166,181],"complexity":[3,63],"of":[4,10,43,115,120,168],"decomposing":[5,152],"a":[6,25,52,90,112,153,177],"graph":[7,26,39,88,128,154],"by":[8,19,132,155,200],"means":[9],"clique":[11,133,201],"separators.":[12],"This":[13],"common":[14],"algorithmic":[15,182],"tool,":[16],"first":[17],"introduced":[18],"Tarjan,":[20],"allows":[21],"one":[22],"to":[23,36,110],"cut":[24],"into":[27],"smaller":[28],"pieces,":[29],"and":[30,58,103,117,194],"so":[31],"it":[32,124],"can":[33,92,129,197],"be":[34,93,130,176,198],"applied":[35],"preprocess":[37],"in":[40,95,135,149,180,203],"computation":[42],"optimization":[44],"problems.":[45],"However,":[46],"best-known":[48],"algorithms":[49],"for":[50,71,79,86,172],"computing":[51],"decomposition":[53,91],"have":[54],"respective":[55],"${\\cal":[56,59,96,136],"O}(nm)$-time":[57],"O}(n^{(3+\\alpha)/2})":[60],"=":[61],"o(n^{2.69})$-time":[62],"with":[64,101],"$\\alpha":[65],"<":[66],"2.3729$":[67],"being":[68],"exponent":[70],"matrix":[72],"multiplication.":[73],"Such":[74],"running":[75],"times":[76],"are":[77],"prohibitive":[78],"large":[80],"graphs.":[81],"Here":[82],"we":[83,147],"prove":[84,148],"that":[85,126,151,189],"every":[87,127],"$G$,":[89],"computed":[94],"O}(T(G)":[97],"+":[98],"\\min\\{n^{\\alpha},\\omega^2":[99],"n\\})$-time":[100],"$T(G)$":[102],"$\\omega$":[104],"being,":[105],"respectively,":[106],"time":[108],"needed":[109],"compute":[111],"minimal":[113],"triangulation":[114],"$G$":[116],"clique-number":[119],"$G$.":[121],"In":[122],"particular,":[123],"implies":[125,188],"decomposed":[131,199],"separators":[134,202],"O}(n^{\\alpha}\\log":[137],"n)$-time.":[138],"Based":[139],"on":[140],"prior":[141],"work":[142],"from":[143],"Kratsch":[144],"et":[145],"al.,":[146],"addition":[150],"clique-separators":[156],"is":[157],"as":[158,160,162],"least":[159],"hard":[161],"triangle":[163],"detection.":[164],"Therefore,":[165],"existence":[167],"any":[169],"$o(n^{\\alpha})$-time":[170],"algorithm":[171],"this":[173],"problem":[174],"would":[175],"significant":[178],"breakthrough":[179],"field.":[183],"Finally,":[184],"our":[185],"main":[186],"result":[187],"planar":[190],"graphs,":[191,193],"bounded-treewidth":[192],"bounded-degree":[195],"graphs":[196],"linear":[204],"or":[205],"quasi-linear":[206],"time.":[207]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2025-10-10T00:00:00"}