{"id":"https://openalex.org/W2122952119","doi":"https://doi.org/10.1007/978-3-319-07959-2_5","title":"Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth","display_name":"Experimental Evaluation of a Branch and Bound Algorithm for Computing Pathwidth","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2122952119","doi":"https://doi.org/10.1007/978-3-319-07959-2_5","mag":"2122952119"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-07959-2_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-07959-2_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"David Coudert","raw_affiliation_strings":["Inria, France","Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067914789","display_name":"Dorian Mazauric","orcid":"https://orcid.org/0000-0002-5589-1889"},"institutions":[{"id":"https://openalex.org/I21491767","display_name":"Aix-Marseille Universit\u00e9","ror":"https://ror.org/035xkbk20","country_code":"FR","type":"education","lineage":["https://openalex.org/I21491767"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Dorian Mazauric","raw_affiliation_strings":["Aix-Marseille Universit\u00e9, CNRS, LIF UMR 7279, Marseille, France"],"affiliations":[{"raw_affiliation_string":"Aix-Marseille Universit\u00e9, CNRS, LIF UMR 7279, Marseille, France","institution_ids":["https://openalex.org/I21491767","https://openalex.org/I1294671590"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057804168","display_name":"Nicolas Nisse","orcid":"https://orcid.org/0000-0003-4500-5078"},"institutions":[{"id":"https://openalex.org/I1326498283","display_name":"Institut national de recherche en informatique et en automatique","ror":"https://ror.org/02kvxyf05","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1326498283"]},{"id":"https://openalex.org/I201841394","display_name":"Universit\u00e9 C\u00f4te d'Azur","ror":"https://ror.org/019tgvf94","country_code":"FR","type":"education","lineage":["https://openalex.org/I201841394"]},{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"funder","lineage":["https://openalex.org/I1294671590"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Nicolas Nisse","raw_affiliation_strings":["Inria, France","Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France"],"affiliations":[{"raw_affiliation_string":"Inria, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"Univ. Nice Sophia Antipolis, CNRS, I3S, UMR 7271, Sophia Antipolis, France","institution_ids":["https://openalex.org/I201841394","https://openalex.org/I1294671590"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5020955386"],"corresponding_institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I201841394"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.0021,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.87331861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"58"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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.9990000128746033,"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.9937999844551086,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9905999898910522,"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/pathwidth","display_name":"Pathwidth","score":0.8660769462585449},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.5817055106163025},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5466658473014832},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5025596618652344},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4983663558959961},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.4634535014629364},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.4602344036102295},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4542466104030609},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4486147463321686},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4337153732776642},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4229724407196045},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4131108522415161},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3830673396587372},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36913052201271057},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35965996980667114},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34186673164367676},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2976922392845154},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.11946961283683777}],"concepts":[{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.8660769462585449},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.5817055106163025},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5466658473014832},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5025596618652344},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4983663558959961},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.4634535014629364},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4602344036102295},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4542466104030609},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4486147463321686},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4337153732776642},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4229724407196045},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4131108522415161},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3830673396587372},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36913052201271057},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35965996980667114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34186673164367676},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2976922392845154},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.11946961283683777},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-07959-2_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-07959-2_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W1559538863","https://openalex.org/W1582492864","https://openalex.org/W1628915153","https://openalex.org/W1742274822","https://openalex.org/W1967700023","https://openalex.org/W1990761146","https://openalex.org/W2013967419","https://openalex.org/W2015469394","https://openalex.org/W2019137761","https://openalex.org/W2033405938","https://openalex.org/W2063778405","https://openalex.org/W2076164610","https://openalex.org/W2076322499","https://openalex.org/W2079966248","https://openalex.org/W2087083200","https://openalex.org/W2095776972","https://openalex.org/W2096882055","https://openalex.org/W2101400962","https://openalex.org/W2107284348","https://openalex.org/W2112136399","https://openalex.org/W2114769758","https://openalex.org/W2118348318","https://openalex.org/W2122952119","https://openalex.org/W2124568589","https://openalex.org/W2125058377","https://openalex.org/W2126517143","https://openalex.org/W2137766675","https://openalex.org/W2143693959","https://openalex.org/W2151617868","https://openalex.org/W2154788235","https://openalex.org/W2172138179","https://openalex.org/W2477600508","https://openalex.org/W2737804344","https://openalex.org/W3101261387"],"related_works":["https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W2125058377","https://openalex.org/W1511821218","https://openalex.org/W2175868772","https://openalex.org/W2027388354","https://openalex.org/W1586184743","https://openalex.org/W1485639265","https://openalex.org/W2059372025","https://openalex.org/W1973972417"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}