An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs
碩士 === 國立清華大學 === 資訊工程學系 === 92 === Let G = (V, E) be an undirected planar graph embedded in R2 with vertex set V and edge set E. Each edge e�• has a non-negative integral length l(e). Let (r1, s1) and (r2, s2) be two distinct pairs of vertices of G adjacent to the unbounded face. Let b1 and b2 be t...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/46083599568918362561 |