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 |
id |
ndltd-TW-092NTHU5392021 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-092NTHU53920212015-10-13T13:08:03Z http://ndltd.ncl.edu.tw/handle/46083599568918362561 An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs 在平面圖上尋找兩條不共點且長度有限制的路徑之改良演算法 Jun-Jay Wang 王俊傑 碩士 國立清華大學 資訊工程學系 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 two positive integers. Given G, (r1, s1), (r2, s2), b1 and b2, we consider the problem of finding two vertex-disjoint paths P1 and P2 such that Pi is a path from ri to si and the length of Pi is at most bi for i = 1, 2. Previously, Holst and Pina [18] proposed a pseudo-polynomial time algorithm for this problem, which takes O(|V|^4*L^2) time, where L=max{b1, b2}. In this thesis, an improved algorithm is proposed. The proposed algorithm requires O(|V|^3*L^2) time. Biing-Feng Wang 王炳豐 2004 學位論文 ; thesis 24 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立清華大學 === 資訊工程學系 === 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 two positive integers. Given G, (r1, s1), (r2, s2), b1 and b2, we consider the problem of finding two vertex-disjoint paths P1 and P2 such that Pi is a path from ri to si and the length of Pi is at most bi for i = 1, 2.
Previously, Holst and Pina [18] proposed a pseudo-polynomial time algorithm for this problem, which takes O(|V|^4*L^2) time, where L=max{b1, b2}. In this thesis, an improved algorithm is proposed. The proposed algorithm requires O(|V|^3*L^2) time.
|
author2 |
Biing-Feng Wang |
author_facet |
Biing-Feng Wang Jun-Jay Wang 王俊傑 |
author |
Jun-Jay Wang 王俊傑 |
spellingShingle |
Jun-Jay Wang 王俊傑 An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
author_sort |
Jun-Jay Wang |
title |
An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
title_short |
An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
title_full |
An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
title_fullStr |
An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
title_full_unstemmed |
An Improved Algorithm for Finding Two Length-Bounded Vertex-Disjoint Paths in Planar Graphs |
title_sort |
improved algorithm for finding two length-bounded vertex-disjoint paths in planar graphs |
publishDate |
2004 |
url |
http://ndltd.ncl.edu.tw/handle/46083599568918362561 |
work_keys_str_mv |
AT junjaywang animprovedalgorithmforfindingtwolengthboundedvertexdisjointpathsinplanargraphs AT wángjùnjié animprovedalgorithmforfindingtwolengthboundedvertexdisjointpathsinplanargraphs AT junjaywang zàipíngmiàntúshàngxúnzhǎoliǎngtiáobùgòngdiǎnqiězhǎngdùyǒuxiànzhìdelùjìngzhīgǎiliángyǎnsuànfǎ AT wángjùnjié zàipíngmiàntúshàngxúnzhǎoliǎngtiáobùgòngdiǎnqiězhǎngdùyǒuxiànzhìdelùjìngzhīgǎiliángyǎnsuànfǎ AT junjaywang improvedalgorithmforfindingtwolengthboundedvertexdisjointpathsinplanargraphs AT wángjùnjié improvedalgorithmforfindingtwolengthboundedvertexdisjointpathsinplanargraphs |
_version_ |
1717732084597915648 |