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

From Algorithm Wiki

Revision as of 08:56, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

Time Complexity

$O(n^{4})$

Space Complexity

$O(n^{3})$ words

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

Description

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Ioannidou;_Kyriaki;_Mertzios;_George_B.;_Nikolopoulos;_Stavros_D._(Longest_Path_on_Interval_Graphs_Longest_Path_Problem)&oldid=47032"