Title of article
The parity path problem on some subclasses of perfect graphs
Author/Authors
C.R. Satyan، نويسنده , , C. Pandu Rangan، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1995
Pages
10
From page
293
To page
302
Abstract
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.
Keywords
Permutation graph , Cocomparability graph , Comparability graph , Graph , Parity , Path
Journal title
Discrete Applied Mathematics
Serial Year
1995
Journal title
Discrete Applied Mathematics
Record number
884412
Link To Document