{"id":"https://openalex.org/W2055691408","doi":"https://doi.org/10.1007/s00453-003-1026-5","title":"Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition","display_name":"Computing the Treewidth and the Minimum Fill-In with the Modular Decomposition","publication_year":2003,"publication_date":"2003-05-09","ids":{"openalex":"https://openalex.org/W2055691408","doi":"https://doi.org/10.1007/s00453-003-1026-5","mag":"2055691408"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-003-1026-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1026-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://dspace.library.uu.nl:8080/handle/1874/1882","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5032730524","display_name":"Hans L. Bodlaender","orcid":"https://orcid.org/0000-0002-9297-3330"},"institutions":[{"id":"https://openalex.org/I193662353","display_name":"Utrecht University","ror":"https://ror.org/04pp8hn57","country_code":"NL","type":"education","lineage":["https://openalex.org/I193662353"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Hans L. Bodlaender","raw_affiliation_strings":["Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. hansb@cs.uu.nl., NL","Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. [email\u00a0protected], NL#TAB#"],"affiliations":[{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. hansb@cs.uu.nl., NL","institution_ids":["https://openalex.org/I193662353"]},{"raw_affiliation_string":"Institute of Information and Computing Sciences, Utrecht University, P.O. Box 80.089, 3508 TB Utrecht, The Netherlands. [email\u00a0protected], NL#TAB#","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069504394","display_name":"Udi Rotics","orcid":null},"institutions":[{"id":"https://openalex.org/I55693919","display_name":"Netanya Academic College","ror":"https://ror.org/03d7p8g51","country_code":"IL","type":"education","lineage":["https://openalex.org/I55693919"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Udi Rotics","raw_affiliation_strings":["School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100 Netanya, Israel. rotics@mars.netanya.ac.il., IL","School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100 Netanya, Israel. rotics@mars.netanya.ac.il., IL#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100 Netanya, Israel. rotics@mars.netanya.ac.il., IL","institution_ids":["https://openalex.org/I55693919"]},{"raw_affiliation_string":"School of Mathematics and Computer Science, Netanya Academic College, P.O. Box 120, 42100 Netanya, Israel. rotics@mars.netanya.ac.il., IL#TAB#","institution_ids":["https://openalex.org/I55693919"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5032730524"],"corresponding_institution_ids":["https://openalex.org/I193662353"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.4538,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.8199808,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"36","issue":"4","first_page":"375","last_page":"408"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T11567","display_name":"semigroups and automata theory","score":0.996999979019165,"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.9127148389816284},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.8414579033851624},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6408349275588989},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6250474452972412},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.5586661100387573},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.5345003008842468},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.5242222547531128},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5152890682220459},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.5066505074501038},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.5014090538024902},{"id":"https://openalex.org/keywords/clique-sum","display_name":"Clique-sum","score":0.448660284280777},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44318076968193054},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43642735481262207},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4025547504425049},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.2574010491371155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24524402618408203},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.07251730561256409}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9127148389816284},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.8414579033851624},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6408349275588989},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6250474452972412},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.5586661100387573},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.5345003008842468},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.5242222547531128},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5152890682220459},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.5066505074501038},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.5014090538024902},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.448660284280777},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44318076968193054},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43642735481262207},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4025547504425049},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2574010491371155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24524402618408203},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.07251730561256409},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-003-1026-5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-003-1026-5","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.19.1314","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.19.1314","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://archive.cs.uu.nl/pub/RUU/CS/techreps/CS-2001/2001-22.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.638.7144","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.638.7144","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.uu.nl/research/techreps/repo/CS-2001/2001-22.pdf","raw_type":"text"},{"id":"pmh:oai:dspace.library.uu.nl:1874/1882","is_oa":true,"landing_page_url":"http://dspace.library.uu.nl:8080/handle/1874/1882","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"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":"","raw_type":"Preprint"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/1882","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/1882","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"","raw_type":"info:eu-repo/semantics/preprint"},{"id":"pmh:uu:oai:dspace.library.uu.nl:1874/23972","is_oa":true,"landing_page_url":"https://dspace.library.uu.nl/handle/1874/23972","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:dspace.library.uu.nl:1874/1882","is_oa":true,"landing_page_url":"http://dspace.library.uu.nl:8080/handle/1874/1882","pdf_url":null,"source":{"id":"https://openalex.org/S4306401649","display_name":"Utrecht University Repository (Utrecht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193662353","host_organization_name":"Utrecht University","host_organization_lineage":["https://openalex.org/I193662353"],"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":"","raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W144954708","https://openalex.org/W1480846237","https://openalex.org/W1487575948","https://openalex.org/W1538450036","https://openalex.org/W1569612812","https://openalex.org/W1576293797","https://openalex.org/W1588395561","https://openalex.org/W1590198494","https://openalex.org/W1978452004","https://openalex.org/W1985733932","https://openalex.org/W2012154006","https://openalex.org/W2012545074","https://openalex.org/W2014488291","https://openalex.org/W2027388354","https://openalex.org/W2027562075","https://openalex.org/W2027566319","https://openalex.org/W2029448190","https://openalex.org/W2034501206","https://openalex.org/W2035331304","https://openalex.org/W2040405987","https://openalex.org/W2052388845","https://openalex.org/W2062004151","https://openalex.org/W2085550081","https://openalex.org/W2086058377","https://openalex.org/W2087083200","https://openalex.org/W2091208300","https://openalex.org/W2117657015","https://openalex.org/W2123596476","https://openalex.org/W2139404577","https://openalex.org/W2143474538","https://openalex.org/W2153209610","https://openalex.org/W2153362081","https://openalex.org/W2165605193","https://openalex.org/W2170633983"],"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/W1874754796","https://openalex.org/W143512583","https://openalex.org/W1568291796"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}