Login / Signup

On the Existence and Determination of Satisfactory Partitions in a Graph.

Cristina BazganZsolt TuzaDaniel Vanderpooten
Published in: ISAAC (2003)
Keyphrases
  • bipartite graph
  • case study
  • np hard
  • complementarity problems
  • real time
  • learning algorithm
  • website
  • markov random field
  • random walk
  • connected components
  • graph structure
  • equivalence classes
  • space partitioning