Login / Signup
How to keep a dynamic distributive directed graph acyclic and yet grant all requests of edge additions.
Shimon Even
Yachin Pnueli
Published in:
Jerusalem Conference on Information Technology (1990)
Keyphrases
</>
directed graph
strongly connected
disjoint paths
undirected graph
random walk
edge weights
np hard
directed acyclic graph
edge information
dynamic environments
graph properties
directed edges
graph structure
bipartite graph
maximum flow
markov chain
computational complexity