Given an undirected graph and there are some edges connecting the nodes. There can be path between two nodes. We have to disconnect two nodes by removing the minimum number of edges. What is the best algorithm to solve this problem?
↧
Channel:
CodeChef Discuss - latest questions
X
Are you the publisher?
Claim or
contact us
about this channel.
X
0
Channel Details:
- Title: CodeChef Discuss - latest questions
- Channel Number: 12597213
- Language: English
- Registered On: April 20, 2013, 8:18 pm
- Number of Articles: 40121
- Latest Snapshot: March 26, 2019, 3:26 am
- RSS URL: http://discuss.codechef.com/feeds/rss
- Publisher: https://discuss.codechef.com/feeds/rss?
- Description: Ask and answer questions.
- Catalog: //codechef17.rssing.com/catalog.php?indx=12597213
© 2025 //www.rssing.com