English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

On the Complexity of Fixed Parameter Clique and Dominating Set

MPS-Authors
/persons/resource/persons44373

Eisenbrand,  Friedrich
Discrete Optimization, MPI for Informatics, Max Planck Society;

/persons/resource/persons44519

Grandoni,  Fabrizio
Discrete Optimization, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Eisenbrand, F., & Grandoni, F. (2004). On the Complexity of Fixed Parameter Clique and Dominating Set. Theoretical computer science, 326, 57-67.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-2AEE-C
Abstract
There is no abstract available