Distributed processing of graphs: Fundamental cycles algorithm
From MaRDI portal
Recommendations
- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- A self-stabilizing algorithm for detecting fundamental cycles in a graph with DFS spanning tree given
- Distributed graph algorithms and their complexity: an introduction
- Distributed algorithms for finding small cycle covers in arbitrary networks
- Algorithms for some graph problems on a distributed computational model
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Distributed Graph Algorithm: Knot Detection
- A new distributed depth-first-search algorithm
- Algorithms for some graph problems on a distributed computational model
- Distributed algorithms for finding centers and medians in networks
- Efficient Parallel Algorithms for a Class of Graph Theoretic Problems
- Fast, Efficient Parallel Algorithms for Some Graph Problems
- Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation
- scientific article; zbMATH DE number 3573250 (Why is no real title available?)
- Termination detection for diffusing computations
Cited in
(8)- A self-stabilizing algorithm for detecting fundamental cycles in a graph
- An efficient distributed bridge-finding algorithm
- scientific article; zbMATH DE number 3854419 (Why is no real title available?)
- scientific article; zbMATH DE number 3949732 (Why is no real title available?)
- Distributed algorithms for finding small cycle covers in arbitrary networks
- Low-complexity distributed algorithms on large-scale graphs: a brief review
- Distributed graph algorithms and their complexity: an introduction
- Algorithms for some graph problems on a distributed computational model
This page was built for publication: Distributed processing of graphs: Fundamental cycles algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1186357)