An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree

DOI10.1007/978-3-642-38756-2_4zbMath1303.05198OpenAlexW2403027038MaRDI QIDQ5405912

Marcin Krzywkowski

Publication date: 3 April 2014

Published in: Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38756-2_4

zbMATH Keywords

treedomination2-dominationexponential algorithmlisting algorithmcombinatorial boundminimal 2-dominating set

Mathematics Subject Classification ID

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)

This page was built for publication: An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree