Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter)

From Algorithm Wiki

Revision as of 11:54, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(M*V^omega*polylog(M, V)$) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2012 == Reference == https://dl.acm.org/doi/abs/10.1145/2736283")

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

Jump to navigation Jump to search

Time Complexity

$O(M*V^omega*polylog(M, V)$)

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2012

Reference

https://dl.acm.org/doi/abs/10.1145/2736283

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cygan,_Gabow,_Sankowski_(Bounded_integer_weights_Graph_Diameter)&oldid=45003"