Login / Signup

The Parameterized Complexity of the Induced Matching Problem in Planar Graphs.

Hannes MoserSomnath Sikdar
Published in: FAW (2007)
Keyphrases
  • planar graphs
  • parameterized complexity
  • global constraints
  • minimum weight
  • fixed parameter tractable
  • objective function
  • probabilistic model
  • linear programming