Disjoint Paths on Some Classes of Graphs
碩士 === 國立中正大學 === 資訊工程研究所 === 82 === Let G=(V,E) be an undirected graph and let [s_i,t_i],1 .ltoreq. i .ltoreq. k, be k pairs of vertices of G. The vertex-disjoint paths problem is to find k paths P_1,...,P_k such that P_i connects s_i and...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
1994
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89114222131448699530 |