Parallel algorithms for connectivity problems in graph theory
From MaRDI portal
Publication:3802645
DOI10.1080/00207168608803490zbMath0655.68088OpenAlexW1986982360WikidataQ126245699 ScholiaQ126245699MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)
Related Items (1)
Cites Work
- 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
- Unnamed Item
- Unnamed Item
This page was built for publication: Parallel algorithms for connectivity problems in graph theory