Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem)

Time Complexity

$O(n^{4})$

Space Complexity

$O(n^{3})$ words

(https://link.springer.com/content/pdf/10.1007/s00453-010-9411-3.pdf)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2011

Reference

https://link.springer.com/content/pdf/10.1007/s00453-010-9411-3.pdf