Pages that link to "Item:Q4864433"
From MaRDI portal
The following pages link to Efficient Parallel Algorithms for Graphs of Bounded Tree-Width (Q4864433):
Displaying 36 items.
- A data-parallel algorithm for minimum-width tree layout (Q293301) (← links)
- Approximation algorithms for digraph width parameters (Q476883) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q834592) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Treewidth computations. I: Upper bounds (Q964001) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- An optimal parallel processor bound in strong orientation of an undirected graph (Q1062459) (← links)
- A parallel algorithm for bisection width in trees (Q1103410) (← links)
- A simple parallel algorithm for computing the diameters of all vertices in a tree and its application (Q1198069) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Efficiently parallelizable problems on a class of decomposable graphs (Q1765226) (← links)
- Reduction algorithms for graphs of small treewidth (Q1854433) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Space-efficient vertex separators for treewidth (Q2165026) (← links)
- An improvement of Reed's treewidth approximation (Q2232243) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- Typical sequences revisited -- computing width parameters of graphs (Q2701067) (← links)
- I/O-efficient algorithms for graphs of bounded treewidth (Q2768277) (← links)
- A \(c^k n\) 5-approximation algorithm for treewidth (Q2799353) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Graph Minors and Parameterized Algorithm Design (Q2908540) (← links)
- Un algorithme parallèle efficace pour construire un arbre de poids minimal dans un graphe (Q3688127) (← links)
- (Q3773332) (← links)
- Parallel complexity of lexicographically first problems for tree- structured graphs (Q3975140) (← links)
- (Q4415792) (← links)
- Modular-Width: An Auxiliary Parameter for Parameterized Parallel Complexity (Q4632210) (← links)
- Parallel algorithms with optimal speedup for bounded treewidth (Q4645184) (← links)
- An Improvement of Reed’s Treewidth Approximation (Q5049997) (← links)
- The parallel complexity of tree embedding problems (extended abstract) (Q5096766) (← links)
- AN IMPROVED ALGORITHM FOR FINDING TREE DECOMPOSITIONS OF SMALL WIDTH (Q5249045) (← links)
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836) (← links)
- Tree decompositions and social graphs (Q5856440) (← links)
- A sufficiently fast algorithm for finding close to optimal clique trees (Q5940778) (← links)
- Computing LOGCFL certificates (Q5958329) (← links)
- Efficient parallel algorithms for some tree layout problems (Q6085718) (← links)
