Login / Signup

An Efficiently Solvable Graph Partition Problem to Which Many Problems are Reducible.

Fanica Gavril
Published in: Inf. Process. Lett. (1993)
Keyphrases
  • np complete
  • data sets
  • special case
  • optimization problems
  • random walk
  • bipartite graph
  • graph structure
  • exact and approximate