Sort and Search: exact algorithms for generalized domination
From MaRDI portal
Publication:989487
DOI10.1016/j.ipl.2009.03.023zbMath1197.05104OpenAlexW2052354073WikidataQ60488704 ScholiaQ60488704MaRDI QIDQ989487
Mathieu Liedloff, Petr A. Golovach, Fedor V. Fomin, Jan Kratochvíl, Dieter Kratsch
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.03.023
Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
Parameterized complexity of generalized domination problems ⋮ Branch and recharge: exact algorithms for generalized domination ⋮ Exact algorithms for problems related to the densest \(k\)-set problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for four variants of the exact satisfiability problem
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Computing Partitions with Applications to the Knapsack Problem
- The Parametrized Complexity of Some Fundamental Problems in Coding Theory
- MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
This page was built for publication: Sort and Search: exact algorithms for generalized domination
