Ioannidou; Kyriaki; Mertzios; George B.; Nikolopoulos; Stavros D. (Longest Path on Interval Graphs Longest Path Problem): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== 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://community.dur.ac.uk/george.mertzios/papers/Conf/Conf_Longest-Interval.pdf") |
No edit summary |
||
| Line 31: | Line 31: | ||
== Reference == | == Reference == | ||
https:// | https://link.springer.com/content/pdf/10.1007/s00453-010-9411-3.pdf | ||
Latest revision as of 08:56, 10 April 2023
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