The Longest Path Problem is Polynomial on Cocomparability Graphs

Kyriaki Ioannidou, Stavros D. Nikolopoulos. The Longest Path Problem is Polynomial on Cocomparability Graphs. In Dimitrios M. Thilikos, editor, Graph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, Zarós, Crete, Greece, June 28-30, 2010 Revised Papers. Volume 6410 of Lecture Notes in Computer Science, pages 27-38, 2010. [doi]

Abstract

Abstract is missing.