Login / Signup
Minimum length of cycles through specified vertices in graphs with wide-diameter at most d.
Toru Kojima
Kiyoshi Ando
Published in:
Ars Comb. (2001)
Keyphrases
</>
minimum length
average degree
shortest path
digital curves
weighted graph
shortest path problem
labeled graphs
attributed graphs
directed graph
random graphs
co occurrence
random walk
graph matching
adjacency matrix