Skip to main content

3 Result(s)

within Kyriaki Ioannidou Remove this filter Mathematics of Computing Remove this filter

and

  1. No Access

    Article

    The Longest Path Problem Is Polynomial on Cocomparability Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. As a generalization of the Hamiltonian path problem, it is NP-complete on general graphs and, in fact, on every class of ...

    Kyriaki Ioannidou, Stavros D. Nikolopoulos in Algorithmica (2013)

  2. No Access

    Article

    The Longest Path Problem has a Polynomial Solution on Interval Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, ...

    Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos in Algorithmica (2011)

  3. No Access

    Chapter and Conference Paper

    The Longest Path Problem Is Polynomial on Interval Graphs

    The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it is NP-hard on general graphs, ...

    Kyriaki Ioannidou, George B. Mertzios… in Mathematical Foundations of Computer Scien… (2009)