On the Neighbourhood Helly of Some Graph Classes and Applications to the Enumeration of Minimal Dominating Sets
From MaRDI portal
Publication:4909546
DOI10.1007/978-3-642-35261-4_32zbMath1260.05163MaRDI QIDQ4909546
Lhouari Nourine, Mamadou Moustapha Kanté, Arnaud Mary, Vincent Limouzy
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-35261-4_32
algorithms; enumeration; line graphs; path graphs; bounded neighbourhood Helly; minimal domonating set
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C76: Graph operations (line graphs, products, etc.)
