Counting Minimum Weighted Dominating Sets

DOI10.1007/978-3-540-73545-8_18zbMath1206.05074OpenAlexW1572075663MaRDI QIDQ3608842

Fedor V. Fomin, Alexey A. Stepanov

Publication date: 6 March 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-73545-8_18

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Bounds on the maximum number of minimum dominating sets ⋮ Bicolored independent sets and bicliques

This page was built for publication: Counting Minimum Weighted Dominating Sets