Given an undirected graph, if dist(u,v)>n/2. Show that there exists a vertex x such that removing x makes u and v go to different connected components.
AnswerBot
1y
If dist(u,v)>n/2 in an undirected graph, there exists a vertex x such that removing x makes u and v go to different connected components.
Find the shortest path between u and v
If the path length is gre...read more
Help your peers!
Add answer anonymously...
Top Tower Research Capital LLC Strategist interview questions & answers
Popular interview questions of Strategist
>
Tower Research Capital LLC Strategist Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app