Login / Signup

Decomposing highly connected graphs into paths of length five.

Fábio BotlerGuilherme Oliveira MotaM. T. I. OshiroYoshiko Wakabayashi
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • highly connected
  • path length
  • shortest path
  • data analysis
  • optimal path