Erratum to: ``Linear time algorithms for generalized edge dominating set problems

DOI10.1007/s00453-011-9558-6zbMath1236.68292OpenAlexW2002312566MaRDI QIDQ2428651

Ojas Parekh, André Berger

Publication date: 26 April 2012

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-011-9558-6

zbMATH Keywords

edge dominating set problems

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Approximation algorithms (68W25)

Related Items (4)

On total unimodularity of edge-edge adjacency matrices ⋮ Minimum-Cost $$b$$-Edge Dominating Sets on Trees ⋮ Minimum-cost \(b\)-edge dominating sets on trees ⋮ On \(b\)-matchings and \(b\)-edge dominating sets: a 2-approximation algorithm for the 4-edge dominating set problem

Cites Work

• Linear time algorithms for generalized edge dominating set problems

This page was built for publication: Erratum to: ``Linear time algorithms for generalized edge dominating set problems