de.mpg.escidoc.pubman.appbase.FacesBean
English
 
Help Guide Disclaimer Contact us Login
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

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

MPS-Authors
http://pubman.mpdl.mpg.de/cone/persons/resource/persons44612

Hermelin,  Danny
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator
There are no locators available
Fulltext (public)
There are no public fulltexts available
Supplementary Material (public)
There is no public supplementary material available
Citation

Hermelin, D., Mnich, M., & van Leeuwen, E. J. (2012). Parameterized Complexity of Induced H-Matching on Claw-Free Graphs. In L. Epstein, & P. Ferragina (Eds.), Algorithms - ESA 2012 (pp. 624-635). Berlin: Springer.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0014-BD54-2
Abstract
There is no abstract available