Login / Signup

Maximum Weight Independent Sets and Matchings in Sparse Random Graphs. Exact Results Using the Local Weak Convergence Method.

David GamarnikTomasz NowickiGrzegorz Swirszcz
Published in: APPROX-RANDOM (2004)
Keyphrases
  • maximum weight
  • objective function
  • computational complexity
  • segmentation method
  • high dimensional
  • special case
  • dynamic programming
  • bipartite graph matching
  • probabilistic model