On making directed graphs transitive.

Mathias Weller Christian Komusiewicz Rolf Niedermeier Johannes Uhlmann

Published in: J. Comput. Syst. Sci. (2012)

Keyphrases

directed graph
random walk
directed acyclic graph
disjoint paths
undirected graph
strongly connected
image sequences
reinforcement learning
web graph
transitive closure
database
feature selection
markov chain
graph structure
maximum flow