The parallel complexity of tree embedding problems (extended abstract)
From MaRDI portal
Recommendations
- The Parallel Complexity of Tree Embedding Problems
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- On the complexity of tree embedding problems
- scientific article; zbMATH DE number 54593
- scientific article; zbMATH DE number 1138356
- scientific article; zbMATH DE number 17799
- Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
- scientific article; zbMATH DE number 3945345
- Efficient parallel algorithms for some tree layout problems
- Parallel Algorithms with Optimal Speedup for Bounded Treewidth
Cites work
- An Efficient Parallel Biconnectivity Algorithm
- Constructing a perfect matching is in random NC
- Graph minors. XIII: The disjoint paths problem
- Graph minors. XV: Giant steps
- Matching is as easy as matrix inversion
- Nonconstructive tools for proving polynomial-time decidability
- On the Computational Complexity of Combinatorial Problems
- Parallelism in random access machines
- Processor Efficient Parallel Algorithms for the Two Disjoint Paths Problem and for Finding a Kuratowski Homeomorph
- Subtree Isomorphism in O(n5/2)
- Subtree isomorphism is in random NC
- Subtree isomorphism is NC reducible to bipartite perfect matching
- The Parallel Evaluation of General Arithmetic Expressions
Cited in
(5)- scientific article; zbMATH DE number 3866594 (Why is no real title available?)
- Parallel Tree Contraction Part 2: Further Applications
- The Parallel Complexity of Tree Embedding Problems
- Sequential and parallel algorithms for embedding problems on classes of partial k-trees
- Notes on the Distributed Computation of Merge Trees on CW-Complexes
This page was built for publication: The parallel complexity of tree embedding problems (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096766)
