Login / Signup

Decompositions of highly connected graphs into paths of any given length.

Fábio BotlerGuilherme Oliveira MotaM. T. I. OshiroYoshiko Wakabayashi
Published in: Electron. Notes Discret. Math. (2015)
Keyphrases
  • highly connected
  • path length
  • data analysis
  • databases
  • social networks
  • singular value decomposition
  • optimal path