Journal of Algorithms
On n-domination, n-dependence and forbidden subgraphs
Graph theory with applications to algorithms and computer science
Bibliography on domination in graphs and some basic definitions of domination parameters
Discrete Mathematics - Topics on domination
Discrete Applied Mathematics
Efficient sets in partial k-trees
Discrete Applied Mathematics
Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees
Vertex partitioning problems: characterization, complexity and algorithms on partial K-trees
Practical Algorithms on Partial k-Trees with an Application to Domination-like Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Graph Theory With Applications
Graph Theory With Applications
Partitioning graphs into generalized dominating sets
Nordic Journal of Computing
Generalized domination in chordal graphs
Nordic Journal of Computing
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Complexity of Partial Covers of Graphs
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Improved Tree Decomposition Based Algorithms for Domination-like Problems
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Mod-2 Independence and Domination in Graphs
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
On multiple coverings of the infinite rectangular grid with balls of constant radius
Discrete Mathematics
Graph separators: a parameterized view
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Designs, Codes and Cryptography
Sort and Search: Exact algorithms for generalized domination
Information Processing Letters
Computational complexity of generalized domination: a complete dichotomy for chordal graphs
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Generalized domination in degenerate graphs: a complete dichotomy of computational complexity
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Discrete Applied Mathematics
Faster algorithms on branch and clique decompositions
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Parameterized complexity of generalized domination problems
Discrete Applied Mathematics
A parameterized route to exact puzzles: breaking the 2n-barrier for irredundance (Extended Abstract)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Information Processing Letters
Branch and recharge: exact algorithms for generalized domination
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
The algorithmic complexity of k-domatic partition of graphs
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Discrete Applied Mathematics
Proceedings of the 2nd ACM SIGPLAN workshop on Functional high-performance computing
Parameterized complexity of weak odd domination problems
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks
Theoretical Computer Science
| Hi-index | 0.00 |
Many graph parameters are the optimal value of an objective function over selected subsets S of vertices with some constraint on how many selected neighbors vertices in S, and vertices not in S, can have. Classic examples are minimum dominating set and maximum independent set. We give a characterization of these graph parameters that unifies their definitions, facilitates their common algorithmic treatment and allows for their uniform complexity classification. This characterization provides the basis for a taxonomy of domination-type and independence-type problems. We investigate the computational complexity of problems within this taxonomy, identify classes of NP-complete problems and classes of problems solvable in polynomial time.