Login / Signup
From omnitigs to macrotigs: a linear-time algorithm for safe walks - common to all closed arc-coverings of a directed graph.
Massimo Cairo
Romeo Rizzi
Alexandru I. Tomescu
Elia C. Zirondelli
Published in:
CoRR (2020)
Keyphrases
</>
directed graph
random walk
equivalence relation
queueing networks
directed acyclic graph
graph structure
directed edges
disjoint paths
maximum flow
rough sets
shortest path problem
state space
transition matrix
graph properties
machine learning
combinatorial optimization
web graph
social networks
data mining