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

NodeSketch: Highly-Efficient Graph Embeddings via Recursive Sketching.

Dingqi YangPaolo RossoBin LiPhilippe Cudré-Mauroux
Published in: KDD (2019)
Keyphrases
  • highly efficient
  • graph representation
  • low cost
  • low complexity
  • graph theory
  • low latency
  • random walk
  • graph structure
  • gray code
  • data structure
  • upper bound
  • directed graph
  • sketch recognition