Discussiones Mathematicae Graph Theory · 1995 · 20 citations · 3 references
ComputingComputer ScienceAlgorithmsCombinatoricsGraph AlgorithmsGraph TheoryAlgorithmic Graph TheoryComputational Complexity Of Graph AlgorithmsDominating Set ApproximationDominating Sets
An edge dominating set of a graph is a set D of edges such that every edge not in D is adjacent to at least one edge in D: In this paper we present a linear time algorithm for flnding a minimum edge dominating set of a block graph.
3
Edge Dominating Sets in Graphs
Mihalis Yannakakis, Fǎnicǎ Gavril · SIAM Journal on Applied Mathematics · 1980 · 391 citations
S. Mitchell · Medical Entomology and Zoology · 1977 · 86 citations
Suresh Jayaram · Graphs and Combinatorics · 1987 · 38 citations