A polynomial algorithm for the parity path problem on perfectly orientable graphs

Authors:
Srinivasa R. Arikati;Uri N. Peled
Affiliations:
-;-
Venue:
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Year:
1996

On the Recognition of P4-Comparability Graphs

WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Parallel algorithms for P4-comparability graphs

Journal of Algorithms
Finding an induced path of given parity in planar graphs in polynomial time

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The good, the bad, and the odd: cycles in answer-set programs

ESSLLI'10 Proceedings of the 2010 international conference on New Directions in Logic, Language and Computation

Hi-index	0.00