Parameterized Algorithms for Generalized Domination
From MaRDI portal
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
Recommendations
- Parameterized Complexity of Generalized Domination Problems
- Parameterized complexity of generalized domination problems
- Partial vs. Complete Domination: t-Dominating Set
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- On the approximability and exact algorithms for vector domination and related problems in graphs
Cites work
- A note on domination in bipartite graphs
- A threshold of ln n for approximating set cover
- Approximation algorithms for combinatorial problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1025912 (Why is no real title available?)
- scientific article; zbMATH DE number 1507224 (Why is no real title available?)
- scientific article; zbMATH DE number 1559541 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Improved Parameterized Upper Bounds for Vertex Cover
- Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
- On the existence of subexponential parameterized algorithms
- Parametrized complexity theory.
- Paths, Trees, and Flowers
- Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
- Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs
- Threshold dominating sets and an improved characterization of \(W[2]\)
Cited in
(25)- Threshold dominating sets and an improved characterization of \(W[2]\)
- Structural parameterizations of dominating set variants
- Subexponential fixed-parameter algorithms for partial vector domination
- Constant thresholds can make target set selection tractable
- On the parameterized complexity of \([1,j]\)-domination problems
- Improved parameterized algorithms and kernels for mixed domination
- The parameterized complexity of dominating set and friends revisited for structured graphs
- scientific article; zbMATH DE number 1617251 (Why is no real title available?)
- (Total) vector domination for graphs with bounded branchwidth
- Vertex cover, dominating set and my encounters with parameterized complexity and Mike Fellows
- Subexponential fixed-parameter algorithms for partial vector domination
- Parameterized complexity of generalized domination problems
- Parameterized Complexity for Domination Problems on Degenerate Graphs
- Partial vs. Complete Domination: t-Dominating Set
- Triangles, 4-Cycles and Parameterized (In-)Tractability
- Parameterized Complexity of Generalized Domination Problems
- Grouped domination parameterized by vertex cover, twin cover, and beyond
- Profit parameterizations of \textsc{Dominating Set}
- Complexity of positive influence domination on partial grids
- FPT approximation using treewidth: capacitated vertex cover, target set selection and vector dominating set
- Structural parameterizations of the biclique-free vertex deletion problem
- Structural parameterizations for two bounded degree problems revisited
- Parameterized reductions and algorithms for a graph editing problem that generalizes vertex cover
- On bounded-degree vertex deletion parameterized by treewidth
- Combinatorial properties of a general domination problem with parity constraints
This page was built for publication: Parameterized Algorithms for Generalized Domination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505650)
