{"id":"https://openalex.org/W2017492235","doi":"https://doi.org/10.1137/s0097539795289859","title":"Parallel Algorithms with Optimal Speedup for Bounded Treewidth","display_name":"Parallel Algorithms with Optimal Speedup for Bounded Treewidth","publication_year":1998,"publication_date":"1998-12-01","ids":{"openalex":"https://openalex.org/W2017492235","doi":"https://doi.org/10.1137/s0097539795289859","mag":"2017492235"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795289859","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795289859","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/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":["Dept. of Computer Science, Utrecht Univ., TB Utrecht, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Dept. of Computer Science, Utrecht Univ., TB Utrecht, The Netherlands","institution_ids":["https://openalex.org/I193662353"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059236728","display_name":"Torben Hagerup","orcid":"https://orcid.org/0000-0001-6974-2473"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Torben Hagerup","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"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":null,"apc_paid":null,"fwci":3.5591,"has_fulltext":false,"cited_by_count":128,"citation_normalized_percentile":{"value":0.92702444,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"27","issue":"6","first_page":"1725","last_page":"1746"},"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.9997000098228455,"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.95049649477005},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7724581956863403},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6766493320465088},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6227163672447205},{"id":"https://openalex.org/keywords/tree-decomposition","display_name":"Tree decomposition","score":0.5735685229301453},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5256786942481995},{"id":"https://openalex.org/keywords/tree-depth","display_name":"Tree-depth","score":0.523646354675293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.462897926568985},{"id":"https://openalex.org/keywords/partial-k-tree","display_name":"Partial k-tree","score":0.4548105299472809},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45055556297302246},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4308401346206665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39547431468963623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.37836891412734985},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3710881173610687},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37098997831344604},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.3378260135650635},{"id":"https://openalex.org/keywords/chordal-graph","display_name":"Chordal graph","score":0.29031652212142944},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.2540626525878906},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.170913428068161},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.06471660733222961}],"concepts":[{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.95049649477005},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7724581956863403},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6766493320465088},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6227163672447205},{"id":"https://openalex.org/C70501317","wikidata":"https://www.wikidata.org/wiki/Q462095","display_name":"Tree decomposition","level":5,"score":0.5735685229301453},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5256786942481995},{"id":"https://openalex.org/C69284658","wikidata":"https://www.wikidata.org/wiki/Q7837500","display_name":"Tree-depth","level":5,"score":0.523646354675293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.462897926568985},{"id":"https://openalex.org/C128764233","wikidata":"https://www.wikidata.org/wiki/Q7140374","display_name":"Partial k-tree","level":5,"score":0.4548105299472809},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45055556297302246},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4308401346206665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39547431468963623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37836891412734985},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3710881173610687},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37098997831344604},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.3378260135650635},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.29031652212142944},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.2540626525878906},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.170913428068161},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.06471660733222961},{"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.1137/s0097539795289859","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795289859","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:uni-augsburg.opus-bayern.de:46275","is_oa":false,"landing_page_url":"https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/46275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400930","display_name":"OPUS (Augsburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I119916105","host_organization_name":"Augsburg University","host_organization_lineage":["https://openalex.org/I119916105"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":51,"referenced_works":["https://openalex.org/W25445610","https://openalex.org/W52866718","https://openalex.org/W1503004197","https://openalex.org/W1569612250","https://openalex.org/W1636203894","https://openalex.org/W1836127928","https://openalex.org/W1964089073","https://openalex.org/W1965874601","https://openalex.org/W1971056052","https://openalex.org/W1971163629","https://openalex.org/W1981573606","https://openalex.org/W1982584550","https://openalex.org/W1983860528","https://openalex.org/W1995040285","https://openalex.org/W1999061527","https://openalex.org/W2005079828","https://openalex.org/W2010600799","https://openalex.org/W2013444956","https://openalex.org/W2014495691","https://openalex.org/W2015439916","https://openalex.org/W2018876684","https://openalex.org/W2023518480","https://openalex.org/W2028357390","https://openalex.org/W2034282023","https://openalex.org/W2035243909","https://openalex.org/W2038176627","https://openalex.org/W2038303785","https://openalex.org/W2043344835","https://openalex.org/W2049021301","https://openalex.org/W2054284059","https://openalex.org/W2059372025","https://openalex.org/W2067661972","https://openalex.org/W2081385108","https://openalex.org/W2085550081","https://openalex.org/W2087083200","https://openalex.org/W2092895206","https://openalex.org/W2098879666","https://openalex.org/W2104397737","https://openalex.org/W2115666768","https://openalex.org/W2125058377","https://openalex.org/W2148691049","https://openalex.org/W2150235218","https://openalex.org/W2150867067","https://openalex.org/W2151617868","https://openalex.org/W2163137752","https://openalex.org/W2164578838","https://openalex.org/W2169102947","https://openalex.org/W3175367423","https://openalex.org/W4213327355","https://openalex.org/W4234361933","https://openalex.org/W4254690835"],"related_works":["https://openalex.org/W2027388354","https://openalex.org/W1973972417","https://openalex.org/W1485639265","https://openalex.org/W2985636744","https://openalex.org/W1587078595","https://openalex.org/W133962531","https://openalex.org/W2162616398","https://openalex.org/W2962819865","https://openalex.org/W2059372025","https://openalex.org/W143512583"],"abstract_inverted_index":{"We":[0,37],"describe":[1],"the":[2,23,34,47,52,88,100,108],"first":[3],"parallel":[4,41],"algorithm":[5,24],"with":[6,43,94],"optimal":[7,44],"speedup":[8,45],"for":[9,46,65],"constructing":[10],"minimum-width":[11],"tree":[12],"decompositions":[13],"of":[14,16,49,54,68,72],"graphs":[15,71],"bounded":[17,59,73],"treewidth.":[18],"On":[19,84],"n-vertex":[20,85],"input":[21,56,86],"graphs,":[22,87],"works":[25],"in":[26,80],"O((log":[27],"n)2)":[28],"time":[29,98,106],"using":[30],"O(n)":[31,91],"operations":[32,92],"on":[33,70,99,107],"EREW":[35,101],"PRAM.":[36,110],"also":[38],"give":[39],"faster":[40],"algorithms":[42,89],"problem":[48],"deciding":[50],"whether":[51],"treewidth":[53],"an":[55],"graph":[57],"is":[58],"by":[60],"a":[61,66],"given":[62],"constant":[63],"and":[64],"variety":[67],"problems":[69,78],"treewidth,":[74],"including":[75],"all":[76],"decision":[77],"expressible":[79],"monadic":[81],"second-order":[82],"logic.":[83],"use":[90],"together":[93],"O(log":[95,104],"n":[96],"log*n)":[97],"PRAM,":[102],"or":[103],"n)":[105],"CRCW":[109]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":37},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":5}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}