Branch and Recharge: Exact Algorithms for Generalized Domination

DOI10.1007/978-3-540-73951-7_44MaRDI QIDQ3603553zbMATH OpenOpenAlexFDO

Authors Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff

Publication date 17 February 2009

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-73951-7_44

zbMATH Keywords

enumerationdominating set

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) Enumeration in graph theory (05C30)

Recommendations

• Sort and Search: exact algorithms for generalized domination
• Branch and recharge: exact algorithms for generalized domination
• Graph-Theoretic Concepts in Computer Science
• Parameterized complexity of generalized domination problems
• scientific article; zbMATH DE number 1202982

Cited in

(3)

• Sort and Search: exact algorithms for generalized domination
• Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
• Branch and recharge: exact algorithms for generalized domination

This page was built for publication: Branch and Recharge: Exact Algorithms for Generalized Domination

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