Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
From MaRDI portal
Publication:4864433
DOI10.1006/jagm.1996.0002zbMath0840.68058OpenAlexW2010600799MaRDI QIDQ4864433
Publication date: 20 February 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0002
Graph theory (including graph drawing) in computer science (68R10) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Distributed algorithms (68W15)
Related Items
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, An Improvement of Reed’s Treewidth Approximation, Fixed-Parameter Tractability of Treewidth and Pathwidth, Graph Minors and Parameterized Algorithm Design, Online promise problems with online width metrics, Space-efficient vertex separators for treewidth, Typical sequences revisited -- computing width parameters of graphs, Approximation algorithms for digraph width parameters, Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity, An improvement of Reed's treewidth approximation, Treewidth computations. I: Upper bounds, A sufficiently fast algorithm for finding close to optimal clique trees, A $c^k n$ 5-Approximation Algorithm for Treewidth, Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs, Efficient parallel algorithms for parameterized problems, Finding small-width connected path decompositions in polynomial time, AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH, Tree decompositions and social graphs, Reduction algorithms for graphs of small treewidth, Counting \(H-\)colorings of partial \(k-\)trees
