Distributed processing of graphs: Fundamental cycles algorithm

DOI10.1016/0020-0255(92)90004-RzbMath0764.68046MaRDI QIDQ1186357

Pranay Chaudhuri

Publication date: 28 June 1992

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

distributed algorithmfundamental cycles of a graphtime and communication complexities

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Related Items (2)

An efficient distributed bridge-finding algorithm ⋮ A self-stabilizing algorithm for detecting fundamental cycles in a graph

Cites Work

• Unnamed Item
• Algorithms for some graph problems on a distributed computational model
• A new distributed depth-first-search algorithm
• Termination detection for diffusing computations
• Distributed algorithms for finding centers and medians in networks
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
• Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
• Fast, Efficient Parallel Algorithms for Some Graph Problems
• A Distributed Graph Algorithm: Knot Detection
• A Distributed Algorithm for Minimum-Weight Spanning Trees

This page was built for publication: Distributed processing of graphs: Fundamental cycles algorithm