A linear algorithm for centering a spanning tree of a biconnected graph

DOI10.1016/0020-0190(94)00066-2zbMath0799.68144OpenAlexW1978594916MaRDI QIDQ1332759

K. S. Easwarakumar, C. Pandu Rangan, Grant A. Cheston

Publication date: 30 November 2000

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

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00066-2

zbMATH Keywords

centerspanning tree\(st\)-numberinglinear-time algorithmbiconnected graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

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

Cites Work

• Centering a spanning tree of a biconnected graph
• Computing an st-numbering
• Unnamed Item
• Unnamed Item

This page was built for publication: A linear algorithm for centering a spanning tree of a biconnected graph