An optimal parallel connectivity algorithm
From MaRDI portal
Publication:797997
DOI10.1016/0166-218X(84)90019-2zbMATH Open0546.68044MaRDI QIDQ797997FDOQ797997
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- An efficient and fast parallel-connected component algorithm
- scientific article; zbMATH DE number 3930349
- An optimal parallel co-connectivity algorithm
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- An Efficient Parallel Biconnectivity Algorithm
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40) Theory of operating systems (68N25)
Cites Work
- Finding the maximum, merging, and sorting in a parallel computation model
- An Efficient Parallel Biconnectivity Algorithm
- Simulation of Parallel Random Access Machines by Circuits
- The Parallel Evaluation of General Arithmetic Expressions
- An O(logn) parallel connectivity algorithm
- Computing connected components on parallel computers
- Ultracomputers
- Implementation of simultaneous memory address access in models that forbid it
- Title not available (Why is that?)
- An O(n2log n) parallel max-flow algorithm
- A unified approach to models of synchronous parallel machines
Cited In (17)
- An Efficient Parallel Biconnectivity Algorithm
- Approximating unweighted connectivity problems in parallel
- A faster parallel algorithm for \(k\)-connectivity
- Parameterized algorithms for finding highly connected solution
- An 0(log n) parallel algorithm for strong connectivity augmentation problem
- Graph theory (algorithmic, algebraic, and metric problems)
- Approximate parallel scheduling. II: Applications to logarithmic-time optimal parallel graph algorithms
- Parallelism and the maximal path problem
- Connection Scan Algorithm
- Deterministic Massively Parallel Connectivity
- An efficient and fast parallel-connected component algorithm
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- Title not available (Why is that?)
- Parameterized algorithms for finding highly connected solution
- An optimal parallel algorithm to construct a deap
- On efficient parallel strong orientation
- An optimal parallel co-connectivity algorithm
This page was built for publication: An optimal parallel connectivity algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797997)
