{"id":"https://openalex.org/W4281732444","doi":"https://doi.org/10.1145/3490148.3538590","title":"Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs","display_name":"Fully Polynomial-Time Distributed Computation in Low-Treewidth Graphs","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4281732444","doi":"https://doi.org/10.1145/3490148.3538590"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538590","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538590","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538590","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538590","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101050681","display_name":"Taisuke Izumi","orcid":null},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Taisuke Izumi","raw_affiliation_strings":["Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037751789","display_name":"Naoki Kitamura","orcid":"https://orcid.org/0000-0002-3143-7200"},"institutions":[{"id":"https://openalex.org/I98285908","display_name":"Osaka University","ror":"https://ror.org/035t8zc32","country_code":"JP","type":"education","lineage":["https://openalex.org/I98285908"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Naoki Kitamura","raw_affiliation_strings":["Osaka University, Osaka, Japan"],"affiliations":[{"raw_affiliation_string":"Osaka University, Osaka, Japan","institution_ids":["https://openalex.org/I98285908"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5073296037","display_name":"Takamasa Naruse","orcid":null},"institutions":[{"id":"https://openalex.org/I197274945","display_name":"Nagoya Institute of Technology","ror":"https://ror.org/055yf1005","country_code":"JP","type":"education","lineage":["https://openalex.org/I197274945"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Takamasa Naruse","raw_affiliation_strings":["Nagoya Institute of Technology, Aichi, Japan"],"affiliations":[{"raw_affiliation_string":"Nagoya Institute of Technology, Aichi, Japan","institution_ids":["https://openalex.org/I197274945"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067916743","display_name":"Gregory Schwartzman","orcid":"https://orcid.org/0000-0002-8461-1479"},"institutions":[{"id":"https://openalex.org/I177738480","display_name":"Japan Advanced Institute of Science and Technology","ror":"https://ror.org/03frj4r98","country_code":"JP","type":"education","lineage":["https://openalex.org/I177738480"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Gregory Schwartzman","raw_affiliation_strings":["Japan Advanced Institute of Science and Technology, Ishikawa, Japan"],"affiliations":[{"raw_affiliation_string":"Japan Advanced Institute of Science and Technology, Ishikawa, Japan","institution_ids":["https://openalex.org/I177738480"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101050681"],"corresponding_institution_ids":["https://openalex.org/I98285908"],"apc_list":null,"apc_paid":null,"fwci":0.3017,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.58220622,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"11","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/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/T10829","display_name":"Interconnection Networks and Systems","score":0.9987000226974487,"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.9110270738601685},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.820770263671875},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6271514296531677},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6038978099822998},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5514395236968994},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.49472901225090027},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.4681195318698883},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.43171918392181396},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.40434181690216064},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35469672083854675},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3499472141265869},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.33844515681266785},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32793793082237244},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25394880771636963},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06766059994697571},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.06746342778205872}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.9110270738601685},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.820770263671875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6271514296531677},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6038978099822998},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5514395236968994},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.49472901225090027},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.4681195318698883},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.43171918392181396},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.40434181690216064},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35469672083854675},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3499472141265869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33844515681266785},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32793793082237244},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25394880771636963},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06766059994697571},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.06746342778205872}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538590","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538590","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538590","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3490148.3538590","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3490148.3538590","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3490148.3538590","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1368453013","display_name":null,"funder_award_id":"19K11824","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G3670916553","display_name":null,"funder_award_id":"21H05","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G444672418","display_name":null,"funder_award_id":"22H03569","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G5786340949","display_name":null,"funder_award_id":"KAKENHI Grant Number","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7167969490","display_name":"Quantum Algorithms for Large-Scale Quantum Computers: New Horizons and Applications","funder_award_id":"20H04139","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7423565","display_name":null,"funder_award_id":"21H05854","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G7629646015","display_name":"Approximation algorithms in environments with uncertainty","funder_award_id":"19K20216","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G8242562394","display_name":"Bridging the gap between theory and practice for distributed graph algorithms","funder_award_id":"21KK0204","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G92579005","display_name":"Towards a theory of smoothed analysis for distributed computing","funder_award_id":"21K17703","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4281732444.pdf","grobid_xml":"https://content.openalex.org/works/W4281732444.grobid-xml"},"referenced_works_count":42,"referenced_works":["https://openalex.org/W37512724","https://openalex.org/W147275194","https://openalex.org/W1998137177","https://openalex.org/W2022977787","https://openalex.org/W2023365186","https://openalex.org/W2034501275","https://openalex.org/W2040273581","https://openalex.org/W2048098617","https://openalex.org/W2107282727","https://openalex.org/W2112702616","https://openalex.org/W2186715137","https://openalex.org/W2224152264","https://openalex.org/W2275325805","https://openalex.org/W2493557058","https://openalex.org/W2515165863","https://openalex.org/W2592613193","https://openalex.org/W2738712979","https://openalex.org/W2767763836","https://openalex.org/W2774187765","https://openalex.org/W2793058913","https://openalex.org/W2896802580","https://openalex.org/W2914414140","https://openalex.org/W2951760736","https://openalex.org/W2962960360","https://openalex.org/W2962991864","https://openalex.org/W2963245981","https://openalex.org/W2963360194","https://openalex.org/W2963528540","https://openalex.org/W2963873784","https://openalex.org/W2963948050","https://openalex.org/W2963962070","https://openalex.org/W2982545082","https://openalex.org/W3005801624","https://openalex.org/W3094786550","https://openalex.org/W3101974321","https://openalex.org/W3158235093","https://openalex.org/W4205098526","https://openalex.org/W4230551286","https://openalex.org/W4248266426","https://openalex.org/W4254419859","https://openalex.org/W4256354285","https://openalex.org/W6948060495"],"related_works":["https://openalex.org/W1480846237","https://openalex.org/W2012687409","https://openalex.org/W2889180046","https://openalex.org/W2029854525","https://openalex.org/W1976784955","https://openalex.org/W1976463682","https://openalex.org/W143512583","https://openalex.org/W1585579706","https://openalex.org/W1548014395","https://openalex.org/W1544821268"],"abstract_inverted_index":{"We":[0,19],"consider":[1],"global":[2],"problems,":[3],"i.e.":[4],"problems":[5,23],"that":[6,21],"take":[7],"at":[8],"least":[9],"diameter":[10],"time,":[11],"even":[12],"when":[13],"the":[14],"bandwidth":[15],"is":[16],"not":[17],"restricted.":[18],"show":[20],"all":[22],"considered":[24],"admit":[25],"efficient":[26],"solutions":[27],"in":[28],"low-treewidth":[29],"graphs.":[30]},"counts_by_year":[{"year":2023,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}