Digraphs that have at most one walk of a given length with the same endpoints.

Zejun Huang Xingzhi Zhan

Published in: Discret. Math. (2011)

Keyphrases

endpoints
medial axis
geodesic paths
random walk
line segments
equivalence classes
minimal cost
minimal path
single valued
total length
minimal paths
hough transform
directed graph
data sets
computer vision
maximum number