Parallel algorithms for connectivity problems in graph theory
From MaRDI portal
Publication:3802645
DOI10.1080/00207168608803490zbMath0655.68088MaRDI QIDQ3802645
Publication date: 1986
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168608803490
Parallel algorithms; connected graph; bridges; strong orientation; common ancestor; fundamental set of cycles
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C40: Connectivity
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Parallel strong orientation of an undirected graph
- A parallel search algorithm for directed acyclic graphs
- A note on finding the bridges of a graph
- Parallel breadth-first search algorithms for trees and graphs
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Finding Dominators in Directed Graphs
- A Mechanical Analysis of the Cyclic Structure of Undirected Linear Graphs
- Algorithms for finding a fundamental set of cycles for an undirected linear graph
- An algorithm for finding a fundamental set of cycles of a graph