Login / Signup

A projection technique for partitioning the nodes of a graph.

Franz RendlHenry Wolkowicz
Published in: Ann. Oper. Res. (1995)
Keyphrases
  • nodes of a graph
  • random walk
  • markov random walk
  • graph clustering
  • graph partitioning
  • clustering algorithm
  • high dimensional
  • dimensionality reduction
  • shortest path
  • spectral methods