{"id":"https://openalex.org/W2068312052","doi":"https://doi.org/10.1145/1132516.1132575","title":"Linear time low tree-width partitions and algorithmic consequences","display_name":"Linear time low tree-width partitions and algorithmic consequences","publication_year":2006,"publication_date":"2006-05-21","ids":{"openalex":"https://openalex.org/W2068312052","doi":"https://doi.org/10.1145/1132516.1132575","mag":"2068312052"},"language":"en","primary_location":{"id":"doi:10.1145/1132516.1132575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","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/A5070558406","display_name":"Jaroslav Ne\u0161et\u0159il","orcid":"https://orcid.org/0000-0002-5133-5586"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Jaroslav Ne\u0161et\u0159il","raw_affiliation_strings":["Charles University, Czech Republic","Charles Univ., Czech Republic#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Charles University, Czech Republic","institution_ids":["https://openalex.org/I21250087"]},{"raw_affiliation_string":"Charles Univ., Czech Republic#TAB#","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004397700","display_name":"Patrice Ossona de Mendez","orcid":"https://orcid.org/0000-0003-0724-3729"},"institutions":[{"id":"https://openalex.org/I165283593","display_name":"\u00c9cole des Hautes \u00c9tudes en Sant\u00e9 Publique","ror":"https://ror.org/01sc83v92","country_code":"FR","type":"education","lineage":["https://openalex.org/I165283593"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Patrice Ossona de Mendez","raw_affiliation_strings":["\u00c9cole des Hautes \u00c9tudes en Sciences Sociales, Paris, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"\u00c9cole des Hautes \u00c9tudes en Sciences Sociales, Paris, France","institution_ids":["https://openalex.org/I165283593"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.7576,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.97870554,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"391","last_page":"400"},"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.9983999729156494,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7064036726951599},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7015130519866943},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.680321991443634},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5761104822158813},{"id":"https://openalex.org/keywords/graph-homomorphism","display_name":"Graph homomorphism","score":0.49272826313972473},{"id":"https://openalex.org/keywords/homomorphism","display_name":"Homomorphism","score":0.48013803362846375},{"id":"https://openalex.org/keywords/induced-subgraph-isomorphism-problem","display_name":"Induced subgraph isomorphism problem","score":0.43154793977737427},{"id":"https://openalex.org/keywords/induced-subgraph","display_name":"Induced subgraph","score":0.42795485258102417},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.39250123500823975},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3794482350349426},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.23792538046836853},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.16483470797538757},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.12364766001701355}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7064036726951599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7015130519866943},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.680321991443634},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5761104822158813},{"id":"https://openalex.org/C7036158","wikidata":"https://www.wikidata.org/wiki/Q3385162","display_name":"Graph homomorphism","level":5,"score":0.49272826313972473},{"id":"https://openalex.org/C4042151","wikidata":"https://www.wikidata.org/wiki/Q215111","display_name":"Homomorphism","level":2,"score":0.48013803362846375},{"id":"https://openalex.org/C191241153","wikidata":"https://www.wikidata.org/wiki/Q6027240","display_name":"Induced subgraph isomorphism problem","level":5,"score":0.43154793977737427},{"id":"https://openalex.org/C2778012994","wikidata":"https://www.wikidata.org/wiki/Q24743362","display_name":"Induced subgraph","level":4,"score":0.42795485258102417},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.39250123500823975},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3794482350349426},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.23792538046836853},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.16483470797538757},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.12364766001701355},{"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.1145/1132516.1132575","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1132516.1132575","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-00077489v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00077489","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":"2006, pp.391-400","raw_type":"Conference papers"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W10105891","https://openalex.org/W104109059","https://openalex.org/W1494208392","https://openalex.org/W1527664624","https://openalex.org/W1562520397","https://openalex.org/W1978747958","https://openalex.org/W1979740015","https://openalex.org/W1997631839","https://openalex.org/W2008440715","https://openalex.org/W2018615281","https://openalex.org/W2022740029","https://openalex.org/W2028357390","https://openalex.org/W2033405938","https://openalex.org/W2035409201","https://openalex.org/W2037789845","https://openalex.org/W2052210031","https://openalex.org/W2067431706","https://openalex.org/W2071321409","https://openalex.org/W2075921069","https://openalex.org/W2092864936","https://openalex.org/W2092904196","https://openalex.org/W2131735508","https://openalex.org/W2132750992","https://openalex.org/W2296148711","https://openalex.org/W4302076587","https://openalex.org/W4366195077","https://openalex.org/W6629425678","https://openalex.org/W6679626947"],"related_works":["https://openalex.org/W2542507283","https://openalex.org/W3191028777","https://openalex.org/W2789636091","https://openalex.org/W2782277909","https://openalex.org/W2252464404","https://openalex.org/W1548348759","https://openalex.org/W3008959778","https://openalex.org/W2032950096","https://openalex.org/W2766767719","https://openalex.org/W2957388536"],"abstract_inverted_index":{"Classes":[0],"of":[1,44,63,68,75,92,129,138,141,192],"graphs":[2,168,207],"with":[3,21,26,123,163,173,212],"bounded":[4,22,27,124,133,174,213],"expansion":[5,28],"have":[6],"been":[7],"introduced":[8],"in":[9,169,202,208],"[15],":[10],"[12].":[11],"They":[12],"generalize":[13],"both":[14],"proper":[15],"minor":[16],"closed":[17],"classes":[18,20],"and":[19,30,109,147,166],"degree.For":[23],"any":[24,31,45,58,188],"class":[25,121,172,211],"C":[29,49,122,146],"integer":[32],"p":[33,61],"there":[34],"exists":[35],"a":[36,66,102,135,154,170,180,209],"constant":[37],"N(C,p)":[38,56],"so":[39],"that":[40,111,187],"the":[41,90,115,126,130,139,142,159],"vertex":[42],"set":[43],"graph":[46,117,143,190],"G":[47],"\u2208":[48],"may":[50,199],"be":[51,179,200],"partitioned":[52],"into":[53],"at":[54,70,78],"most":[55,71,79],"parts,":[57],"i":[59],"\u2264":[60,196],"parts":[62],"them":[64],"induce":[65],"subgraph":[67,160],"tree-width":[69],"(i-1)":[72],"[12]":[73],"(actually,":[74],"tree-depth":[76],"[16]":[77],"i,":[80],"what":[81],"is":[82,132,150],"sensibly":[83],"stronger).":[84],"Such":[85],"partitions":[86,108],"are":[87],"central":[88],"to":[89,105,118,152],"resolution":[91],"homomorphism":[93,97],"problems":[94],"like":[95],"restricted":[96],"dualities":[98],"[14].We":[99],"give":[100],"here":[101],"simple":[103],"algorithm":[104,131,157],"compute":[106],"such":[107],"prove":[110,186],"if":[112],"we":[113],"restrict":[114],"input":[116,167,206],"some":[119],"fixed":[120,145,164,171,189,210],"expansion,":[125],"running":[127],"time":[128,156,204],"by":[134],"linear":[136,155,203],"function":[137],"order":[140,182],"(for":[144],"p).This":[148],"result":[149],"applied":[151],"get":[153],"for":[158,205],"isomorphism":[161],"problem":[162],"pattern":[165],"expansion.More":[175],"generally,":[176],"let":[177],"\u03c6":[178],"first":[181],"logic":[183],"sentence.":[184],"We":[185],"property":[191],"type":[193],"\"\u2203X:":[194],"(|X|":[195],"p)":[197],"\u21ff(G[X]=\u03c6)\"":[198],"decided":[201],"expansion.":[214]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}