Answering distance queries in directed graphs using fast matrix multiplication.

Raphael Yuster Uri Zwick

Published in: FOCS (2005)

Keyphrases

directed graph
matrix multiplication
answering queries
random walk
query language
query processing
query answering
undirected graph
range queries
directed acyclic graph
strongly connected
computational complexity
message passing
approximate answers
data sources
disjoint paths