Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
From MaRDI portal
Recommendations
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- An efficient and fast parallel-connected component algorithm
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- An optimal parallel connectivity algorithm
- Optimal parallel algorithms on planar graphs
Cites work
- scientific article; zbMATH DE number 4060742 (Why is no real title available?)
- scientific article; zbMATH DE number 3688740 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An optimal parallel connectivity algorithm
- An optimally efficient selection algorithm
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- Computing connected components on parallel computers
- Deterministic coin tossing with applications to optimal parallel list ranking
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Efficient parallel algorithms for some graph problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Faster optimal parallel prefix sums and list ranking
- Finding Euler tours in parallel
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAM
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- On efficient parallel strong orientation
- Optimal Parallel 5-Colouring of Planar Graphs
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Parallel strong orientation of an undirected graph
- The Parallel Evaluation of General Arithmetic Expressions
- The accelerated centroid decomposition technique for optimal parallel tree evaluation in logarithmic time
Cited in
(15)- scientific article; zbMATH DE number 1863264 (Why is no real title available?)
- Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
- scientific article; zbMATH DE number 4113979 (Why is no real title available?)
- Smallest bipartite bridge-connectivity augmentation
- The bridge-connectivity augmentation problem with a partition constraint
- A faster parallel algorithm for \(k\)-connectivity
- Fast Deterministic Processor Allocation
- scientific article; zbMATH DE number 4049080 (Why is no real title available?)
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- Graph connectivity in log steps using label propagation
- An optimal parallel connectivity algorithm
- An I/O efficient algorithm for minimum spanning trees
- Expected parallel time and sequential space complexity of graph and digraph problems
- A parallel algorithm for finding a triconnected component separator with an application
- Planarity testing in parallel
This page was built for publication: Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758188)
