Login / Signup

On the parameterized complexity of multiple-interval graph problems.

Michael R. FellowsDanny HermelinFrances A. RosamondStéphane Vialette
Published in: Theor. Comput. Sci. (2009)
Keyphrases
  • combinatorial problems
  • branch and bound algorithm
  • parameterized complexity
  • graph theory