An O(logn) parallel connectivity algorithm
From MaRDI portal
Cited in
(81)- On efficient parallel strong orientation
- A parallel algorithm for the monadic unification problem
- Finding small simple cycle separators for 2-connected planar graphs
- Parallel ear decomposition search (EDS) and st-numbering in graphs
- Separation and lower bounds for ROM and nondeterministic models of parallel computation
- Communication-efficient parallel algorithms for distributed random-access machines
- Chordal graph recognition is in NC
- A nearly optimal parallel algorithm for constructing maximal independent set in planar graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Parallel computational geometry
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
- A linear systolic algorithm for the connected component problem
- A parallel algorithm for the maximum 2-chain edge packing problem
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Efficient parallel algorithms to test square-freeness and factorize strings
- Processor-time tradeoffs in PRAM simulations
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- Counting clique trees and computing perfect elimination schemes in parallel
- On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
- Vectorized search for single clusters
- Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs
- Static and dynamic parallel computation of connected components
- A new class of parallel algorithms for finding connected components on machines with bit-vector operations
- A parallel algorithm for computing Steiner trees in strongly chordal graphs
- The parallel solution of domination problems on chordal and strongly chordal graphs
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph
- Efficient parallel recognition algorithms of cographs and distance hereditary graphs
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Connected components in \(O(\log^{3/2}n)\) parallel time for the CREW PRAM
- A remark on maximum matching of line graphs
- Monte Carlo circuits for the abelian permutation group intersection problem
- \(O(\log \log n)\)-time integer geometry on the CRCW PRAM
- Sweep methods for parallel computational geometry
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Efficient algorithmic learning of the structure of permutation groups by examples
- Efficient algorithms for acyclic colorings of graphs
- Concurrent disjoint set union
- Fast connected-component labeling
- Conditions for swappability of records in a microdata set when some marginals are fixed
- Optimal parallel algorithms for multiple updates of minimum spanning trees
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- On the parallel computation of the biconnected and strongly connected co-components of graphs
- Parallel computations on graphs
- New fast parallel algorithm for the connected component problem and its VLSI implementation
- On the Strongly Connected and Biconnected Components of the Complement of Graphs
- An nc algorithm to recognize hhd-free graphs
- Adapting parallel algorithms to the W-stream model, with applications to graph problems
- Efficient parallel graph algorithms for coarse grained multicomputers and BSP
- A simple nc algorithm to recognize weakly triangulated graphs
- FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS
- PARALLEL BLOCK-FINDING USING DISTANCE MATRICES
- NC algorithms for weighted planar perfect matching and related problems
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- Graph connectivity in log steps using label propagation
- Log diameter rounds algorithms for 2-vertex and 2-edge connectivity
- Successive approximation in parallel graph algorithms (extended abstract)
- Fast and optimal simulations between CRCW PRAMs
- A perfect parallel dictionary
- Hammock-on-ears decomposition: a technique for the efficient parallel solution of shortest paths and other problems
- Optimal parallel algorithms on planar graphs
- On the complexity of the maximum biplanar subgraph problem
- Computation models and function algebras
- Efficient parallel modular decomposition (extended abstract)
- The parallel complexity of elimination ordering procedures
- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality
- Efficient parallel algorithms for doubly convex-bipartite graphs
- 1-Approximation algorithm for bottleneck disjoint path matching
- Efficient parallel Ising samplers via localization schemes
- Resource bounds for parallel computation of threshold and symmetric functions
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- An optimal parallel connectivity algorithm
- Finding Euler tours in parallel
- Incomplete directed perfect phylogeny in linear time
- A parallel algorithm for eliminating cycles in undirected graphs
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
- A complexity theory of efficient parallel algorithms
- Successive approximation in parallel graph algorithms
- An efficient algorithm for edge coloring planar graphs with \(\Delta\) colors
- Incomparability in parallel computation
This page was built for publication: An O(logn) parallel connectivity algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3957960)
