Minimum-Cost b-Edge Dominating Sets on Trees
Sign Up to like & getrecommendations! Published in 2018 at "Algorithmica"
DOI: 10.1007/s00453-018-0448-z
Abstract: In this paper, we consider the minimum-cost b-edge dominating set problem. This is a generalization of the edge dominating set problem, but the computational complexity for trees is an astonishing open problem. We make steps… read more here.
Keywords: minimum cost; polynomial time; cost edge; edge dominating ... See more keywords
Perfect edge domination: hard and solvable cases
Sign Up to like & getrecommendations! Published in 2018 at "Annals of Operations Research"
DOI: 10.1007/s10479-017-2664-3
Abstract: Let G be an undirected graph. An edge of Gdominates itself and all edges adjacent to it. A subset $$E'$$E′ of edges of G is an edge dominating set of G, if every edge of… read more here.
Keywords: edge dominating; perfect edge; edge; graph ... See more keywords