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: | Jun-Jay Wang, 王俊傑 |
---|---|
Other Authors: | Biing-Feng Wang |
Format: | Others |
Language: | en_US |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/46083599568918362561 |
Similar Items
-
Algorithms for Finding Vertex-disjoint Paths and Edge-disjoint Spanning Trees in Star Graph Interconnection Networks Work Management System
by: Hon, Min Hor, et al.
Published: (1994) -
Constructing Vertex-disjoint Paths in Alternating Group Graphs
by: Lee Wen Hui, et al.
Published: (2014) -
An Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Graphs
by: Mehmet Hakan Karaata
Published: (2019-01-01) -
Computing k-vertex Connectivity and Disjoint s-t Paths on Permutation Graphs
by: Yi-Wen Chen, et al.
Published: (1994) -
Algebraic Connectivity and Disjoint Vertex Subsets of Graphs
by: Yan Sun, et al.
Published: (2020-01-01)