3
此問題是否有名稱?從強連接圖中刪除邊緣
給定一個帶有邊權的有向連通圖。
Find a smallest cost set of edges such that removing that set of edges results in a
graph that isn't strongly connected anymore.
任何人都知道/有解決方案的想法?我想這是網絡流量問題,但我不知道如何繼續。
謝謝
這屬於cstheory.se嗎? – Oddthinking