Login / Signup
Digraphs that contain at most t distinct walks of a given length with the same endpoints.
Zhenhua Lyu
Published in:
J. Comb. Optim. (2021)
Keyphrases
</>
endpoints
minimal cost
line segments
equivalence classes
maximum number
single valued
minimal paths
social network analysis
geodesic paths
minimal path
markov models
fixed length
continuous functions
minimum length
total length