Interleaved adjoints on directed graphs.

Jan Foniok Jaroslav Nesetril Claude Tardif

Published in: CoRR (2009)

Keyphrases

directed graph
random walk
directed acyclic graph
maximum flow
shortest path problem
undirected graph
strongly connected
graph structure
graph properties
lower bound
web graph
gray scale
gray level
xml data
information extraction
upper bound
special case