Sort and Search: exact algorithms for generalized domination

DOI10.1016/J.IPL.2009.03.023zbMATH Open1197.05104DBLPjournals/ipl/FominGKKL09OpenAlexW2052354073WikidataQ60488704 ScholiaQ60488704MaRDI QIDQ989487FDOQ989487

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

zbMATH Keywords

exact algorithmsgraph algorithmsdominationsortingsearching

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Computing Partitions with Applications to the Knapsack Problem
• The Parametrized Complexity of Some Fundamental Problems in Coding Theory
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• MOD-2 INDEPENDENCE AND DOMINATION IN GRAPHS
• Algorithms for four variants of the exact satisfiability problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• Parameterized complexity of generalized domination problems
• Branch and recharge: exact algorithms for generalized domination
• Title not available (Why is that?)
• Exact algorithms for problems related to the densest \(k\)-set problem

This page was built for publication: Sort and Search: exact algorithms for generalized domination

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