A simple parallel tree contraction algorithm
From MaRDI portal
Recommendations
- Parallel Tree Contraction Part 2: Further Applications
- Graph algorithms on a tree-structured parallel computer
- scientific article; zbMATH DE number 1218792
- A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
- Parallel recognition of complement reducible graphs and cotree construction
Cited in
(61)- A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles
- Deciding whether graph \(G\) has page number one is in NC
- Efficient parallel algorithms for shortest paths in planar digraphs
- Parallel methods for visibility and shortest-path problems in simple polygons
- Matching parentheses in parallel
- Efficient parallel algorithms for r-dominating set and p-center problems on trees
- More general parallel tree contraction: Register allocation and broadcasting in a tree
- A linear time algorithm for the maximum matching problem on cographs
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Visibility with a moving point of view
- A simple optimal parallel algorithm for a core of a tree
- The parallel solution of domination problems on chordal and strongly chordal graphs
- Parallel algorithm for finding a core of a tree network
- Local consistency in parallel constraint satisfaction networks
- Parallel maximum independent set in convex bipartite graphs
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Parallel evaluation of arithmetic circuits
- A note on parallel algorithms for optimal h-v drawings of binary trees
- Parallel algorithms for the minimum cut and the minimum length tree layout problems
- A time-optimal solution for the path cover problem on cographs.
- Computing Prüfer codes efficiently in parallel
- Efficiently parallelizable problems on a class of decomposable graphs
- Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree
- Parallel preprocessing for path queries without concurrent reading.
- An efficient parallel algorithm for finding rectangular duals of plane triangular graphs
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- An optimal parallel algorithm for planar cycle separators
- Sweep methods for parallel computational geometry
- An NC algorithm for finding a minimum weighted completion time schedule on series parallel graphs
- Parallel approximation schemes for problems on planar graphs
- Parallel algorithms for the Hamiltonian cycle and Hamiltonian path problems in semicomplete bipartite digraphs
- A faster parallel connectivity algorithm on cographs
- The Hamiltonian problem on distance-hereditary graphs
- scientific article; zbMATH DE number 440476 (Why is no real title available?)
- scientific article; zbMATH DE number 3950554 (Why is no real title available?)
- Parallel Tree Contraction Part 2: Further Applications
- Optimal parallel colouring algorithms for totally decomposable graphs
- An Improved Ray Shooting Method for Constructive Solid Geometry Models Via Tree Contraction
- The Optimal Alphabetic Tree problem revisited
- Parallel algorithms with optimal speedup for bounded treewidth
- THE OPTIMAL LOCATION OF A STRUCTURED FACILITY IN A TREE NETWORK
- AN EFFICIENT EREW ALGORITHM FOR MINIMUM PATH COVER AND HAMILTONICITY ON COGRAPHS
- A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- Efficient parallel algorithms for shortest paths in planar graphs
- Parallel algorithm for cograph recognition with applications
- Improved parallel depth-first search in undirected planar graphs
- Sequential random permutation, list contraction and tree contraction are highly parallel
- Finding the \(k\) most vital edges with respect to minimum spanning trees for fixed \(k\)
- Efficient parallel algorithms for some tree layout problems
- On parallel recognition of cographs
- More general parallel tree contraction: register allocation and broadcasting in a tree
- Homogeneous sets and domination problems
- Parallel tree-contraction and Fibonacci numbers
- A parallel tree difference algorithm
- An O(n) time algorithm for maximum matching on cographs
- Optimal parallel quicksort on EREW PRAM
- On optimal parallel computations for sequences of brackets
- An optimal parallel algorithm forc-vertex-ranking of trees
- Parallel algorithms for fractional and maximal independent sets in planar graphs
- Parallel recognition of complement reducible graphs and cotree construction
This page was built for publication: A simple parallel tree contraction algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4730794)
