Graph with minimum bandwidth and at most k connected components

Правка en3, от govind53, 2024-06-20 22:49:38

There is a network graph given, in which we need to remove few edges to form at the most k connected components. Resulting graph should have minimum possible bandwidth (by bandwidth we mean maximum number of data packets which can pass through the graph). We need to identify the minimum bandwidth possible. Can someone please suggest possible approach to solve this problem?

Теги graphs, mst, dfs, maxflow

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский govind53 2024-06-20 22:49:38 29 Tiny change: 'How to solve below problem:\nThere is a' -> 'There is a'
en2 Английский govind53 2024-06-20 22:48:43 66
en1 Английский govind53 2024-06-20 22:47:39 445 Initial revision (published)