An efficient distributed algorithm for finding all hinge vertices in networks
From MaRDI portal
Publication:5466762
DOI10.1080/00207160412331336008zbMath1098.68143MaRDI QIDQ5466762
Publication date: 25 August 2005
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160412331336008
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W15: Distributed algorithms
Cites Work
- Unnamed Item
- The recognition of geodetically connected graphs
- A linear time algorithm for finding all hinge vertices of a permutation graph
- A fully distributed (minimal) spanning tree algorithm
- Distributed algorithms. 8th international workshop, WDAG 1994, Terschelling, The Netherlands, September 29 -- October 1, 1994. Proceedings
- Minimum self-repairing graphs
- An efficient algorithm for finding all hinge vertices on trapezoid graphs
- A distributed algorithm for constructing a minimum diameter spanning tree
- An efficient distributed bridge-finding algorithm
- Distributed algorithms for finding centers and medians in networks
- A new distributed algorithm to find breadth first search trees
- A Distributed Graph Algorithm: Knot Detection
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Geodetic connectivity of graphs
- Towards minimumk-geodetically connected graphs