The parity path problem on some subclasses of perfect graphs

The parity path problem is the problem of finding two paths of different parity between two given vertices. This problem is known to be NP-complete on general graphs. Polynomial algorithms were known for the parity path problem on chordal, planar perfect, interval and circular-arc graphs. In this pa...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 68; no. 3; pp. 293 - 302
Main Authors Satyan, C.R., Rangan, C.Pandu
Format Journal Article
LanguageEnglish
Published Elsevier B.V 24.07.1996
Subjects
Cocomparability graph
Comparability graph
Graph
Parity
Path
Permutation graph
Path
Cocomparability graph
Graph
Comparability graph
Parity
Permutation graph
Online AccessGet full text

Cover

More Information
Summary:The parity path problem is the problem of finding two paths of different parity between two given vertices. This problem is known to be NP-complete on general graphs. Polynomial algorithms were known for the parity path problem on chordal, planar perfect, interval and circular-arc graphs. In this paper, we give polynomial algorithms for this problem on comparability, cocomparability graphs, and linear algorithms on permutation graphs.
ISSN:0166-218X
1872-6771
DOI:10.1016/0166-218X(95)00065-Y