Binary representation search with matrix multiplication (Unweighted Graph Diameter)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(V^omega log(V)$) where omega is the exponent on matrix multiplication

Space Complexity

$O(V^{2} logV)$ words

(storing all the matrices)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

-

Reference

-

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Binary_representation_search_with_matrix_multiplication_(Unweighted_Graph_Diameter)&oldid=45609"