Branch and Recharge: Exact Algorithms for Generalized Domination
From MaRDI portal
Publication:3603553
DOI10.1007/978-3-540-73951-7_44zbMath1209.05240OpenAlexW1723579409MaRDI QIDQ3603553
Fedor V. Fomin, Mathieu Liedloff, Dieter Kratsch, Jan Kratochvíl, Petr A. Golovach
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
Analysis of algorithms and problem complexity (68Q25) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (1)
This page was built for publication: Branch and Recharge: Exact Algorithms for Generalized Domination
