{"id":"https://openalex.org/W2125547222","doi":"https://doi.org/10.1051/ro:2004011","title":"Heuristic and metaheuristic methods for computing graph treewidth","display_name":"Heuristic and metaheuristic methods for computing graph treewidth","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2125547222","doi":"https://doi.org/10.1051/ro:2004011","mag":"2125547222"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2004011","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2004011","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.numdam.org/item/10.1051/ro:2004011.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039674040","display_name":"Fran\u00e7ois Clautiaux","orcid":"https://orcid.org/0000-0002-9171-8012"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Fran\u00e7ois Clautiaux","raw_affiliation_strings":["Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr"],"affiliations":[{"raw_affiliation_string":"Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr","institution_ids":["https://openalex.org/I4210088387","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014060007","display_name":"Aziz Moukrim","orcid":"https://orcid.org/0000-0003-0151-6327"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Aziz Moukrim","raw_affiliation_strings":["Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr"],"affiliations":[{"raw_affiliation_string":"Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr","institution_ids":["https://openalex.org/I4210088387","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001512126","display_name":"St\u00e9phane N\u00e8gre","orcid":null},"institutions":[{"id":"https://openalex.org/I4647051","display_name":"Universit\u00e9 de Picardie Jules Verne","ror":"https://ror.org/01gyxrk03","country_code":"FR","type":"education","lineage":["https://openalex.org/I4647051"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"St\u00e9phane N\u00e8gre","raw_affiliation_strings":["Laboratoire de Recherche en Informatique d'Amiens, INSSET, 48 rue Raspail, 02100 St\u00a0Quentin, France; stephane.negre@insset.u-picardie.fr"],"affiliations":[{"raw_affiliation_string":"Laboratoire de Recherche en Informatique d'Amiens, INSSET, 48 rue Raspail, 02100 St\u00a0Quentin, France; stephane.negre@insset.u-picardie.fr","institution_ids":["https://openalex.org/I4647051"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088307588","display_name":"Jacques Carlier","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210088387","display_name":"Heuristics and Diagnostics for Complex Systems","ror":"https://ror.org/0075hvk77","country_code":"FR","type":"facility","lineage":["https://openalex.org/I102516824","https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210088387","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Jacques Carlier","raw_affiliation_strings":["Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr"],"affiliations":[{"raw_affiliation_string":"Laboratoire HeuDiaSyC, UMR CNRS 6599, UTC, BP 20529, 60205 Compi\u00e8gne, France; francois.clautiaux@hds.utc.fr., aziz.moukrim@hds.utc.fr., jacques.carlier@hds.utc.fr","institution_ids":["https://openalex.org/I4210088387","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5039674040"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210088387"],"apc_list":null,"apc_paid":null,"fwci":6.2708,"has_fulltext":true,"cited_by_count":39,"citation_normalized_percentile":{"value":0.96856582,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"38","issue":"1","first_page":"13","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9973000288009644,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8994176387786865},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.5647811889648438},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5415672659873962},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5245330929756165},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.5153583884239197},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.515059232711792},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4652247130870819},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4476109743118286},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.4429045021533966},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.42810288071632385},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42582136392593384},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38031789660453796},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3357454836368561},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3295581638813019},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3247391879558563},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29695481061935425},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2540903091430664},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.25014442205429077},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.2482881247997284},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10905671119689941}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.8994176387786865},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.5647811889648438},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5415672659873962},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5245330929756165},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.5153583884239197},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.515059232711792},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4652247130870819},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4476109743118286},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4429045021533966},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.42810288071632385},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42582136392593384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38031789660453796},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3357454836368561},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3295581638813019},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3247391879558563},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29695481061935425},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2540903091430664},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.25014442205429077},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.2482881247997284},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10905671119689941}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1051/ro:2004011","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2004011","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748"],"host_organization_lineage_names":["EDP Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2004__38_1_13_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2004011/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2004011.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},{"id":"pmh:oai:HAL:hal-04816771v1","is_oa":false,"landing_page_url":"https://hal.science/hal-04816771","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RAIRO - Operations Research, 2004, 38 (1), pp.13-26. ⟨10.1051/ro:2004011⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:numdam.org:RO_2004__38_1_13_0","is_oa":true,"landing_page_url":"http://www.numdam.org/articles/10.1051/ro:2004011/","pdf_url":"https://www.numdam.org/item/10.1051/ro:2004011.pdf","source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2125547222.pdf"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W88635354","https://openalex.org/W111380827","https://openalex.org/W1506542774","https://openalex.org/W1973310391","https://openalex.org/W1991477862","https://openalex.org/W2029448190","https://openalex.org/W2037106315","https://openalex.org/W2038674294","https://openalex.org/W2045193931","https://openalex.org/W2059372025","https://openalex.org/W2074342195","https://openalex.org/W2085550081","https://openalex.org/W2086119402","https://openalex.org/W2091278332","https://openalex.org/W2106371135","https://openalex.org/W2125720043","https://openalex.org/W2137849348","https://openalex.org/W2143474538","https://openalex.org/W2157409145","https://openalex.org/W2174973502","https://openalex.org/W2339500526","https://openalex.org/W3022173737","https://openalex.org/W4236605548"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W2084535634","https://openalex.org/W2949315077","https://openalex.org/W1572255008","https://openalex.org/W2584271047","https://openalex.org/W2091382007","https://openalex.org/W4285428820","https://openalex.org/W143512583","https://openalex.org/W2803227791","https://openalex.org/W4402137504"],"abstract_inverted_index":{"The":[0,73,95],"notion":[1],"of":[2,5,75,88,135,159,166,175],"treewidth":[3,35,45,87,130,143,155],"is":[4,36,46,69,78],"considerable":[6],"interest":[7],"in":[8,31,100,157],"relation":[9],"to":[10,25,79,117,170],"NP-hard":[11],"problems.":[12],"Indeed,":[13],"several":[14],"studies":[15],"have":[16,118],"shown":[17],"that":[18],"the":[19,44,58,61,65,86,106,113,125,150,160,167,172],"tree-decomposition":[20],"method":[21],"can":[22],"be":[23],"used":[24,137],"solve":[26],"many":[27,56],"basic":[28],"optimization":[29],"problems":[30,156],"polynomial":[32],"time":[33,174],"when":[34],"bounded,":[37],"even":[38],"if,":[39],"for":[40,84,123,138,154],"arbitrary":[41],"graphs,":[42],"computing":[43,85,173],"NP-hard.":[47],"Several":[48],"papers":[49],"present":[50],"heuristics":[51],"with":[52],"computational":[53],"experiments.":[54],"For":[55],"graphs":[57,136],"discrepancy":[59],"between":[60],"heuristic":[62,91,96],"results":[63,99,115,146,153],"and":[64,92,142],"best":[66,114,152],"lower":[67],"bounds":[68],"still":[70],"very":[71],"large.":[72],"aim":[74],"this":[76],"paper":[77],"propose":[80],"two":[81],"new":[82],"methods":[83],"graphs:":[89],"a":[90,93,101],"metaheuristic.":[94],"returns":[97,112],"good":[98],"short":[102],"computation":[103],"time,":[104],"whereas":[105],"metaheuristic":[107],"(a":[108,132],"Tabu":[109],"search":[110],"method)":[111],"known":[116],"been":[119],"obtained":[120],"so":[121],"far":[122],"all":[124],"DIMACS":[126],"vertex":[127,140],"coloring":[128,141],"/":[129],"benchmarks":[131],"well-known":[133],"collection":[134],"both":[139],"problems.)":[144],"Our":[145],"actually":[147],"improve":[148],"on":[149],"previous":[151],"53%":[158],"cases.":[161],"Moreover,":[162],"we":[163],"identify":[164],"properties":[165],"triangulation":[168],"process":[169],"optimize":[171],"our":[176],"method.":[177]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-03-11T14:59:36.786465","created_date":"2025-10-10T00:00:00"}