Login / Signup

) Split Decomposition of Strongly Connected Graphs.

Benson L. JoerisScott M. LundbergRoss M. McConnell
Published in: Graph Theory, Computational Intelligence and Thought (2009)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • undirected graph
  • decomposition method
  • graph matching
  • decomposition methods
  • np hard
  • random walk
  • binary images
  • graph structure
  • graph structures