An efficient distributed algorithm for centering a spanning tree of a biconnected graph

DOI10.1016/0020-0190(96)00102-0zbMath0900.68333OpenAlexW2082151635WikidataQ127676128 ScholiaQ127676128MaRDI QIDQ671408

R. F. M. Aranha, C. Pandu Rangan

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(96)00102-0

zbMATH Keywords

AlgorithmsSpanning treeBiconnected graphsCenterDistributed graph algorithmsst-numbering

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)

Related Items (1)

AN EFFICIENT DISTRIBUTED ALGORITHM FOR 3-EDGE-CONNECTIVITY

Cites Work

• Centering a spanning tree of a biconnected graph
• Computing an st-numbering
• A linear algorithm for centering a spanning tree of a biconnected graph
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient distributed algorithm for centering a spanning tree of a biconnected graph