Login / Signup
Decompositions of highly connected graphs into paths of length five.
Fábio Botler
Guilherme Oliveira Mota
M. T. I. Oshiro
Yoshiko Wakabayashi
Published in:
Electron. Notes Discret. Math. (2015)
Keyphrases
</>
highly connected
path length
databases
knowledge discovery
shortest path
optimal path
social networks
high precision
directed graph