External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Tags

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

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]

Authors

Kyriaki Ioannidou

This author has not been identified. Look up 'Kyriaki Ioannidou' in Google

Stavros D. Nikolopoulos

This author has not been identified. Look up 'Stavros D. Nikolopoulos' in Google
runs on