Parameterized Complexity of Generalized Domination Problems
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-11409-0_12
Publication URI: http://dx.doi.org/10.1007/978-3-642-11409-0_12
Type: Book Chapter
Book Title: Graph-Theoretic Concepts in Computer Science (2010)
Page Reference: 133-142
ISSN: 03029743 16113349