Login / Signup

Uniformly finite-to-one and onto extensions of homomorphisms between strongly connected graphs.

Masakazu Nasu
Published in: Discret. Math. (1982)
Keyphrases
  • strongly connected
  • directed graph
  • optimum path forest
  • undirected graph
  • graph theory
  • graph structure
  • finite number
  • lower bound
  • association rules
  • random walk
  • graph mining
  • graph representation
  • graph kernels