摘要:
There are several versions of Menger's Theorem, all can be derived from the Max-Flow-Min-Cut Theorem. Undirected, Vertex Version. Let G be an undirected graph, and let u and v be nonadjacent v... 阅读全文
posted @ 2011-08-23 09:30
Joshua Leung
阅读(391)
评论(0)
推荐(0)
浙公网安备 33010602011771号