Login / Signup

Intractability of min- and max-cut in streaming graphs.

Mariano Zelke
Published in: Inf. Process. Lett. (2011)
Keyphrases
  • max cut
  • np complete problems
  • np complete
  • graph model
  • planar graphs
  • graph partitioning
  • np hard
  • spectral graph
  • data streams
  • bayesian networks
  • min max
  • graph coloring
  • random walk
  • data clustering