论文信息 - The edge domination problem

The edge domination problem

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.

Shiow-Fen Hwang | Gerard J. Chang | G. Chang | Shiow-Fen Hwang

[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[2] Mihalis Yannakakis,et al. Edge Dominating Sets in Graphs , 1980 .

[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[4] S. R. Jayaram. Line domination in graphs , 1987, Graphs Comb..