{"id":"https://openalex.org/W2478689417","doi":"https://doi.org/10.1137/15m1034039","title":"To Approximate Treewidth, Use Treelength!","display_name":"To Approximate Treewidth, Use Treelength!","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2478689417","doi":"https://doi.org/10.1137/15m1034039","mag":"2478689417"},"language":"en","primary_location":{"id":"doi:10.1137/15m1034039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1034039","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":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-01348965","any_repository_has_fulltext":true},"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":"middle","author":{"id":"https://openalex.org/A5020003818","display_name":"Guillaume Ducoffe","orcid":"https://orcid.org/0000-0003-2127-5989"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guillaume Ducoffe","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/A5057804168","display_name":"Nicolas Nisse","orcid":"https://orcid.org/0000-0003-4500-5078"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicolas Nisse","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":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2606,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92549675,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"3","first_page":"1424","last_page":"1436"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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":1.0,"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.9976000189781189,"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.9975000023841858,"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/treewidth","display_name":"Treewidth","score":0.876228928565979},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8469604253768921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.700583815574646},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.4540402293205261},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.44905686378479004},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.43733859062194824},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43538475036621094},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4340948462486267},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4246904253959656},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.412492960691452},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.3861927092075348},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10375216603279114}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.876228928565979},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8469604253768921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.700583815574646},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.4540402293205261},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.44905686378479004},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.43733859062194824},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43538475036621094},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4340948462486267},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4246904253959656},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.412492960691452},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.3861927092075348},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10375216603279114},{"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/15m1034039","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1034039","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-01348965v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01348965","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2016, 30 (3), pp.13. ⟨10.1137/15M1034039⟩","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-01348965v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01348965","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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Discrete Mathematics, 2016, 30 (3), pp.13. ⟨10.1137/15M1034039⟩","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"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"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1935074713","https://openalex.org/W1966878439","https://openalex.org/W1979158362","https://openalex.org/W1980831620","https://openalex.org/W1980940295","https://openalex.org/W1993074114","https://openalex.org/W2012872086","https://openalex.org/W2017848317","https://openalex.org/W2028357390","https://openalex.org/W2028400828","https://openalex.org/W2029448190","https://openalex.org/W2032762881","https://openalex.org/W2040168968","https://openalex.org/W2069569594","https://openalex.org/W2076164610","https://openalex.org/W2085550081","https://openalex.org/W2086081739","https://openalex.org/W2087083200","https://openalex.org/W2089941644","https://openalex.org/W2123498553","https://openalex.org/W2126464568","https://openalex.org/W2127485201","https://openalex.org/W4236305466"],"related_works":["https://openalex.org/W1480846237","https://openalex.org/W2012687409","https://openalex.org/W2029854525","https://openalex.org/W2111290740","https://openalex.org/W1976463682","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W1548014395","https://openalex.org/W4297435153","https://openalex.org/W2567822775"],"abstract_inverted_index":{"Tree-likeness":[0],"parameters":[1],"have":[2],"proven":[3],"their":[4,25],"utility":[5],"in":[6,42,47,58,78,203],"the":[7,19,37,51,71,88,98,129,197],"design":[8],"of":[9,22,39,53,73,91,132,199],"efficient":[10],"algorithms":[11],"on":[12,36,83,87,176],"graphs.":[13,43,92],"In":[14,147],"this":[15,29,180],"paper,":[16],"we":[17,31,108,149,188],"relate":[18],"structural":[20],"tree-likeness":[21],"graphs":[23,99,202],"with":[24,69],"metric":[26],"tree-likeness.":[27],"To":[28],"end,":[30],"establish":[32],"new":[33],"upper":[34],"bounds":[35],"diameter":[38,52,116],"minimal":[40,55,112],"separators":[41],"We":[44,93,122,178],"prove":[45,109,127,150],"that":[46,110,128,156],"any":[48,54,111,133,153],"graph":[49,134,154,160],"$G$,":[50],"separator":[56,113],"$S$":[57,114],"$G$":[59,135,155,183],"is":[60,136],"at":[61,117,137],"most":[62,118,138],"$\\lfloor":[63,139],"\\ell(G)":[64,140],"/":[65,141],"2\\rfloor":[66],"\\cdot":[67,120,168],"(|S|-1)$,":[68],"$\\ell(G)$":[70],"length":[72],"a":[74,101,163,190],"longest":[75],"isometric":[76],"cycle":[77,89],"$G$.":[79],"Our":[80],"result":[81],"relies":[82],"algebraic":[84],"methods":[85],"and":[86],"basis":[90],"improve":[94],"our":[95,124],"bound":[96],"for":[97,106,152,170,195],"admitting":[100],"distance":[102],"preserving":[103],"elimination":[104],"ordering,":[105],"which":[107],"has":[115,184],"$2":[119],"(|S|-1)$.":[121],"use":[123],"results":[125],"to":[126],"treelength":[130],"$tl(G)$":[131],"{2}\\rfloor$":[142],"times":[143],"its":[144],"treewidth":[145,198],"$tw(G)$.":[146],"addition,":[148],"that,":[151],"excludes":[157],"an":[158],"apex":[159],"$H$":[161],"as":[162],"minor,":[164],"$tw(G)":[165],"\\leq":[166],"c_H":[167],"tl(G)$":[169],"some":[171],"constant":[172,181],"$c_H$":[173],"only":[174],"depending":[175],"$H$.":[177],"refine":[179],"when":[182],"bounded":[185],"genus.":[186],"Altogether,":[187],"obtain":[189],"simple":[191],"$\\mathcal{O}":[192],"(\\ell(G))$-approximation":[193],"algorithm":[194],"computing":[196],"$n$-node":[200],"apex-minor-free":[201],"$\\mathcal{O}(n^2)$-time.":[204]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":4}],"updated_date":"2026-07-25T09:21:30.201066","created_date":"2025-10-10T00:00:00"}