Parallel Algorithms with Optimal Speedup for Bounded Treewidth
DOI10.1137/S0097539795289859zbMath0907.68089OpenAlexW2017492235MaRDI QIDQ4210129
Torben Hagerup, Hans L. Bodlaender
Publication date: 21 September 1998
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539795289859
monadic second-order logictreewidthparallel algorithmstree decompositiongraph algorithmspathwidthderandomizationgraph reductionpartial \(k\)-trees
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (36)
This page was built for publication: Parallel Algorithms with Optimal Speedup for Bounded Treewidth