Parallel algorithms for treewidth two

DOI10.1007/BFB0024496MaRDI QIDQ4373678zbMATH OpenFDO

Authors Babette de Fluiter, Hans L. Bodlaender

Publication date 16 February 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://dspace.library.uu.nl/handle/1874/18710

zbMATH Keywords

parallel algorithm

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel algorithms for series parallel graphs and graphs with treewidth two
• Parallel algorithms with optimal speedup for bounded treewidth
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• Efficient Parallel Algorithms for Graphs of Bounded Tree-Width

Cited in

(10)

• Parallel recognition and decomposition of two terminal series parallel graphs
• A parallel algorithm for bisection width in trees
• Parallel Algorithms with Optimal Speedup for Bounded Treewidth
• scientific article; zbMATH DE number 1555968 (Why is no real title available?)
• Parallel algorithms with optimal speedup for bounded treewidth
• Computing treewidth on the GPU
• Parallel algorithms for series parallel graphs and graphs with treewidth two
• NC-algorithms for graphs with small treewidth
• A parallel tree difference algorithm
• I/O-efficient algorithms for graphs of bounded treewidth

This page was built for publication: Parallel algorithms for treewidth two

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4373678)