The Non-Separating Connector Problem and Exact Algorithms
碩士 === 國立中正大學 === 資訊工程所 === 98 === Consider a connected graph G = (V,E,w) with nonnegative vertex weight and two vertices {s,t} in V . A connected bipartition (V1, V2) of G is that both subgraphs induced by V1 and V2 are connected. If {s,t} in V2 and w(V2) is min- imize, then the vertex set V2 is ca...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2010
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/45895505666702790804 |