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

Item

ITEM ACTIONSEXPORT

Released

Conference Paper

Hardness of r-DOMINATING SET on Graphs of Diameter (r + 1)

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

Philip,  Geevarghese
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

Locator

Link
(Any fulltext)

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

Lokshtanov, D., Misra, N., Philip, G., Ramanujan, M. S., & Saurabh, S. (2013). Hardness of r-DOMINATING SET on Graphs of Diameter (r + 1). In G. Gutin, & S. Szeider (Eds.), Parameterized and Exact Computation (pp. 255-267). Berlin: Springer. doi:10.1007/978-3-319-03898-8_22.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0024-4774-B
Abstract
There is no abstract available