Partial vs. Complete Domination: t-Dominating Set

DOI10.1007/978-3-540-69507-3_31zbMATH Open1131.68488OpenAlexW1799048485MaRDI QIDQ5448787FDOQ5448787

Authors: Joachim Kneis, Daniel Mölle, Peter Rossmanith 

Publication date: 7 March 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_31

Recommendations

• Parameterized Algorithms for Generalized Domination
• Parameterized Complexity of Generalized Domination Problems
• Parameterized complexity of generalized domination problems
• New parameterized algorithms for the edge dominating set problem
• Parameterized Complexity for Domination Problems on Degenerate Graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited In (24)

• Improved Upper Bounds for Partial Vertex Cover
• On the fixed-parameter tractability of the partial vertex cover problem with a matching constraint in edge-weighted bipartite graphs
• Partial vertex cover and budgeted maximum coverage in bipartite graphs
• On the Parameterized Complexity of the Expected Coverage Problem
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective
• On the parameterized complexity of the expected coverage problem
• An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
• The complexity of probabilistic lobbying
• Parameterized Algorithms for Generalized Domination
• Implicit branching and parameterized partial cover problems
• Approximating partially bounded degree deletion on directed graphs
• Parallel algorithm for minimum partial dominating set in unit disk graph
• Profit parameterizations of \textsc{Dominating Set}
• Parameterized Complexity for Domination Problems on Degenerate Graphs
• SOFSEM 2006: Theory and Practice of Computer Science
• Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph
• Subexponential algorithms for partial cover problems
• Hardness of \(r\)-dominating set on graphs of diameter \((r + 1)\)
• Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
• Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
• Inclusion/exclusion meets measure and conquer
• Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
• Representative families: a unified tradeoff-based approach
• Grouped domination parameterized by vertex cover, twin cover, and beyond

This page was built for publication: Partial vs. Complete Domination: t-Dominating Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5448787)