NC-algorithms for graphs with small treewidth

DOI10.1007/3-540-50728-0_32OpenAlexW1836127928WikidataQ59568086 ScholiaQ59568086MaRDI QIDQ6203537

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

Mathematics Subject Classification ID

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)

Related Items (3)

Algorithms, Complexity, and Hans ⋮ Balancing bounded treewidth circuits ⋮ On treewidth, separators and Yao's garbling

Cites Work

• Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
• Parallel O(log n) time edge-colouring of trees and Halin graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Complexity of Finding Embeddings in a k-Tree
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: NC-algorithms for graphs with small treewidth