Edge domination of distance-hereditary graphs

Abstract

An edge dominating set D of a graph G=(V,E) is a set of edges such that every edge not in D is adjacent to at least one edge in D. This paper gives an O(n4) time algorithm which finds a minimum edge dominating set for a distance-hereditary graph where n=│V│.