Login / Signup

Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes.

Andreas BrandstädtVan Bang LeH. N. de Ridder
Published in: Inf. Process. Lett. (2004)
Keyphrases
  • maximum weight
  • bipartite graph
  • minimum weight
  • graph theory
  • weighted graph
  • computational complexity
  • learning algorithm
  • independent set
  • bipartite matching
  • data structure
  • np hard
  • directed graph
  • greedy heuristic