Vertex disjoint cycles of different lengths in d-arc-dominated digraphs.

Published in: Oper. Res. Lett. (2014)

Keyphrases

directed graph
undirected graph
minimum length
pairwise
computer vision
dynamic programming
random walk
similarity measure
graph structure
equivalence classes