Characterization of efficiently parallel solvable problems on a class of decomposable graphs

DOI10.1007/978-3-540-24685-5_28MaRDI QIDQ5712868zbMATH OpenOpenAlexFDO

Authors Sun-Yuan Hsieh

Publication date 23 December 2005

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

Full work available at URL https://doi.org/10.1007/b97987

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Parallel algorithms in computer science (68W10)

Recommendations

• Efficiently parallelizable problems on a class of decomposable graphs
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs
• scientific article; zbMATH DE number 3905850
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Optimal parallel colouring algorithms for totally decomposable graphs
• scientific article; zbMATH DE number 4068310
• scientific article; zbMATH DE number 1472126
• Efficient parallel algorithms for graph problems
• Efficient Parallel Shortest-Paths in Digraphs with a Separator Decomposition
• scientific article; zbMATH DE number 3930349

Cited in

(11)

• Parallel recognition and decomposition of two terminal series parallel graphs
• Serial and parallel algorithms for \((k,2)\)-partite graphs
• Efficiently parallelizable problems on a class of decomposable graphs
• Notes on 'divide-and-conquer-based optimal parallel algorithms for some graph problems on EREW PRAM model'
• scientific article; zbMATH DE number 4002142 (Why is no real title available?)
• scientific article; zbMATH DE number 17799 (Why is no real title available?)
• scientific article; zbMATH DE number 49212 (Why is no real title available?)
• Optimal parallel colouring algorithms for totally decomposable graphs
• scientific article; zbMATH DE number 1472126 (Why is no real title available?)
• Linear-time computation of optimal subgraphs of decomposable graphs
• Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs

This page was built for publication: Characterization of efficiently parallel solvable problems on a class of decomposable graphs

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