Abstract
Given a biconnected graph G = ( V, E), and an arbitrary vertex v in V, there exists a spanning tree T of G with v in the center of T. We prove this by providing an O(∣ V ∣ · ∣ E ∣) algorithm that constructs such a tree.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
