Login / Signup

Monochromatic connecting colorings in strongly connected oriented graphs.

Diego González-MorenoMucuy-kak GuevaraJuan José Montellano-Ballesteros
Published in: Discret. Math. (2017)
Keyphrases
  • strongly connected
  • directed graph
  • undirected graph
  • optimum path forest
  • computational complexity
  • level set
  • random walk
  • data streams
  • graph structure
  • early vision