An Efficient Fixed-Parameter Enumeration Algorithm for Weighted Edge Dominating Set
From MaRDI portal
Publication:5321717
DOI10.1007/978-3-642-02270-8_25zbMath1248.05207MaRDI QIDQ5321717
Qilong Feng, Jianxin Wang, Jian'er Chen, Beiwei Chen
Publication date: 14 July 2009
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02270-8_25
edge dominating set; minimal vertex cover; matching property; enumerate-and-expand technique; fixed-parameter enumeration algorithm; weighted edge dominating 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.)