• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Parameterized Complexity of Induced H-Matching on Claw-Free Graphs.

Danny HermelinMatthias MnichErik Jan van Leeuwen
Published in: ESA (2012)
Keyphrases
  • parameterized complexity
  • graph matching
  • graph theory
  • graph theoretic
  • fixed parameter tractable
  • graph structure
  • global constraints
  • bounded treewidth