{"id":"https://openalex.org/W1982618738","doi":"https://doi.org/10.1109/ipdpsw.2010.5470828","title":"Distributed tree decomposition of graphs and applications to verification","display_name":"Distributed tree decomposition of graphs and applications to verification","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W1982618738","doi":"https://doi.org/10.1109/ipdpsw.2010.5470828","mag":"1982618738"},"language":"en","primary_location":{"id":"doi:10.1109/ipdpsw.2010.5470828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"},"type":"article","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/A5065309966","display_name":"St\u00e9phane Grumbach","orcid":"https://orcid.org/0000-0003-2093-2262"},"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"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Stephane Grumbach","raw_affiliation_strings":["INRIA-LIAMA, France","INRIA - LIAMA, France"],"affiliations":[{"raw_affiliation_string":"INRIA-LIAMA, France","institution_ids":["https://openalex.org/I1326498283"]},{"raw_affiliation_string":"INRIA - LIAMA, France","institution_ids":["https://openalex.org/I1326498283"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100381605","display_name":"Zhilin Wu","orcid":"https://orcid.org/0000-0003-0899-628X"},"institutions":[{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zhilin Wu","raw_affiliation_strings":["LaBRI, Universit\u00e9 de Bordeaux 1, France","LABRI, Universit\u00e9 de Bordeaux, France#TAB#"],"affiliations":[{"raw_affiliation_string":"LaBRI, Universit\u00e9 de Bordeaux 1, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189"]},{"raw_affiliation_string":"LABRI, Universit\u00e9 de Bordeaux, France#TAB#","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5065309966"],"corresponding_institution_ids":["https://openalex.org/I1326498283"],"apc_list":null,"apc_paid":null,"fwci":0.7067,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69132582,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"11","issue":null,"first_page":"1","last_page":"8"},"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.9980000257492065,"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.9968000054359436,"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/bounded-function","display_name":"Bounded function","score":0.8050782680511475},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5665732026100159},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.551194429397583},{"id":"https://openalex.org/keywords/modular-decomposition","display_name":"Modular decomposition","score":0.5268501043319702},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.489760160446167},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.48603373765945435},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.43881291151046753},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43426260352134705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40844404697418213},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4050828218460083},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.34128057956695557},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.30271464586257935},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14515653252601624}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.8050782680511475},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5665732026100159},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.551194429397583},{"id":"https://openalex.org/C187407849","wikidata":"https://www.wikidata.org/wiki/Q6889712","display_name":"Modular decomposition","level":5,"score":0.5268501043319702},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.489760160446167},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.48603373765945435},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.43881291151046753},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43426260352134705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40844404697418213},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4050828218460083},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.34128057956695557},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.30271464586257935},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14515653252601624},{"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/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ipdpsw.2010.5470828","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ipdpsw.2010.5470828","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1482193060","https://openalex.org/W1526359699","https://openalex.org/W1527664624","https://openalex.org/W1536817373","https://openalex.org/W1570425181","https://openalex.org/W1599740739","https://openalex.org/W1767153417","https://openalex.org/W1806052854","https://openalex.org/W1974070507","https://openalex.org/W1990389251","https://openalex.org/W1991755800","https://openalex.org/W2024291212","https://openalex.org/W2033405938","https://openalex.org/W2034501206","https://openalex.org/W2035020702","https://openalex.org/W2046652577","https://openalex.org/W2059372025","https://openalex.org/W2067016370","https://openalex.org/W2092534058","https://openalex.org/W2092904196","https://openalex.org/W2154788235","https://openalex.org/W2159003936","https://openalex.org/W2986773320","https://openalex.org/W4251986490","https://openalex.org/W6638250694","https://openalex.org/W6683227944"],"related_works":["https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W2125058377","https://openalex.org/W1511821218","https://openalex.org/W1586184743","https://openalex.org/W2027388354","https://openalex.org/W1973972417","https://openalex.org/W1485639265","https://openalex.org/W2060933875","https://openalex.org/W2045379356"],"abstract_inverted_index":{"The":[0],"tree":[1,43],"decomposition":[2],"of":[3,28,30,41,45,57,62,68,84,99],"graphs":[4,29,100],"is":[5],"a":[6,81],"fundamental":[7],"algorithmic":[8],"tool.":[9],"It":[10],"has":[11],"been":[12],"shown":[13],"that":[14],"difficult":[15],"problems,":[16],"such":[17],"as":[18],"some":[19],"NP-complete":[20],"ones,":[21],"can":[22],"be":[23],"solved":[24],"efficiently":[25],"over":[26,87],"classes":[27],"bounded":[31,63,69,72],"tree-width.":[32],"We":[33,49,90],"consider":[34],"in":[35,102],"this":[36],"paper":[37],"the":[38,42,55],"distributed":[39],"construction":[40],"decompositions":[44],"network":[46],"topology":[47],"graphs.":[48],"propose":[50],"algorithms":[51,75,94],"to":[52,95],"distributively":[53,96],"construct":[54],"tree-decomposition":[56],"respectively":[58],"(i)":[59],"planar":[60],"networks":[61,67],"diameter":[64],"and":[65,71],"(ii)":[66],"degree":[70],"tree-length.":[73],"Both":[74],"are":[76],"very":[77],"efficient,":[78],"requiring":[79],"only":[80],"constant":[82],"number":[83],"messages":[85],"sent":[86],"each":[88],"link.":[89],"then":[91],"use":[92],"these":[93],"verify":[97],"properties":[98],"expressible":[101],"Monadic":[103],"Second":[104],"Order":[105],"Logic,":[106],"MSO.":[107]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}