Improved algorithms for finding length-bounded two vertex-disjoint paths in a planar graph and minmax k vertex-disjoint paths in a directed acyclic graph

This paper is composed of two parts. In the first part, an improved algorithm is presented for the problem of finding length-bounded two vertex-disjoint paths in an undirected planar graph. The presented algorithm requires O ( n 3 b min ) time and O ( n 2 b min ) space, where b min is the smaller of...

Full description

Bibliographic Details

Published in:	Journal of computer and system sciences Vol. 76; no. 8; pp. 697 - 708
Main Authors:	Yu, Chih-Chiang, Lin, Chien-Hsin, Wang, Biing-Feng
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.12.2010
Subjects:	Algorithms Directed acyclic graphs Dynamic programming Fully polynomial-time approximation schemes Planar graphs Pseudo-polynomial time Vertex-disjoint paths Algorithms Fully polynomial-time approximation schemes Directed acyclic graphs Planar graphs Pseudo-polynomial time Dynamic programming Vertex-disjoint paths
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!