• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs.

Weiren YuXuemin LinJiajin Le
Published in: WAIM (2010)
Keyphrases
  • computational complexity
  • undirected graph
  • np complete
  • directed graph
  • directed acyclic graph
  • image processing
  • markov chain
  • network analysis