In graph theory, an edge dominating set for a graph G = (V, E) is a subset D ⊆ E such that every edge not in D is adjacent to at least one edge in D… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2012

2012

- Mingyu Xiao, Hiroshi Nagamochi
- TAMC
- 2012

We present an O∗(1.3160n)-time algorithm for the edge dominating set problem in an n-vertex graph, which improves previous exact… (More)

Is this relevant?

Highly Cited

2010

Highly Cited

2010

- Author M. Yannakakis, Fanica Gavril, M. YANNAKAKISt
- 2010

We prove that the edge dominating set problem for graphs is NP-complete ven when restricted toplanar or bipartite graphs of… (More)

Is this relevant?

2010

2010

- Jukka Suomela
- PODC
- 2010

An edge dominating set for a graph <i>G</i> is a set <i>D</i> of edges such that each edge of <i>G</i> is in <i>D</i> or adjacent… (More)

Is this relevant?

2007

2007

- André Berger, Takuro Fukunaga, Hiroshi Nagamochi, Ojas Parekh
- Theor. Comput. Sci.
- 2007

In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge… (More)

Is this relevant?

2007

2007

In this paper, we discuss the approximability of the capacitated b-edge dominating set problem, which generalizes the edge… (More)

Is this relevant?

2006

2006

- Miroslav Chlebík, Janka Chlebíková
- J. Comb. Optim.
- 2006

We provide the first interesting explicit lower bounds on efficient approximability for two closely related optimization problems… (More)

Is this relevant?

2006

2006

- Jean Cardinal, Stefan Langerman, Eythan Levy
- WAOA
- 2006

We analyze the simple greedy algorithm that iteratively removes the endpoints of a maximum-degree edge in a graph, where the… (More)

Is this relevant?

2006

2006

- Doost Ali Mojdeh, Razieh Sadeghi
- 2006

Let G = (V,E) be a finite undirected graph. A set F of the edges of a graph G is an edge dominating set if each edge of E \F is… (More)

Is this relevant?

2001

2001

- Robert Carr
- 2001

We study the approximability of the weighted edge-dominating set problem. Although even the unweighted case is NP-Complete, in… (More)

Is this relevant?

2000

2000

- Toshihiro Fujito
- FSTTCS
- 2000

We investigate polynomial-time approximability of the problems related to edge dominating sets of graphs. When edges are unit… (More)

Is this relevant?