edge dominating set: Efficient Enumeration-Based Exact Algorithms
From MaRDI portal
Publication:3499732
DOI10.1007/11847250_13zbMath1154.68452MaRDI QIDQ3499732
Publication date: 3 June 2008
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11847250_13
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)