Login / Signup

Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning.

Mihail N. KolountzakisGary L. MillerRichard PengCharalampos E. Tsourakakis
Published in: WAW (2010)
Keyphrases
  • graph partitioning
  • database
  • directed graph
  • graph matching
  • pattern recognition
  • lightweight
  • similarity search
  • bipartite graph
  • graph model
  • undirected graph
  • vertex set
  • spectral graph