NC-algorithms for graphs with small treewidth
DOI10.1007/3-540-50728-0_32OpenAlexW1836127928WikidataQ59568086 ScholiaQ59568086MaRDI QIDQ6203537FDOQ6203537
Authors: Hans L. Bodlaender 
Publication date: 28 February 2024
Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16558
Recommendations
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- Parallel algorithms with optimal speedup for bounded treewidth
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
- scientific article; zbMATH DE number 1107730
- Parallel algorithms for series parallel graphs and graphs with treewidth two
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Cites Work
- Title not available (Why is that?)
- Complexity of Finding Embeddings in a k-Tree
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Graph minors. II. Algorithmic aspects of tree-width
- Title not available (Why is that?)
- Parallel O(log n) time edge-colouring of trees and Halin graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: NC-algorithms for graphs with small treewidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203537)
