Login / Signup
On computing the minimum feedback vertex set of a directed graph bycontraction operations.
Hen-Ming Lin
Jing-Yang Jou
Published in:
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2000)
Keyphrases
</>
directed graph
vertex set
undirected graph
maximum distance
random walk
directed acyclic graph
maximum flow
graph structure
strongly connected
spanning tree
special case
social network analysis
transition matrix
directed edges
random graphs
minimum cost
weighted graph
random variables
disjoint paths