Login / Signup
A Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product.
Christophe Crespelle
Eric Thierry
Thomas Lambert
Published in:
COCOON (2013)
Keyphrases
</>
directed graph
cartesian product
random walk
undirected graph
directed acyclic graph
shortest path problem
transition matrix
graph structure
web graph
directed edges
heuristic search
communication networks
graph properties