#### Filter Results:

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

An edge dominating set of a graph G = (V, E) is a subset M ⊆ E of edges such that each edge in E \ M is incident to at least one edge in M. In this paper, we consider the parameterized edge dominating set problem which asks us to test whether a given graph has an edge dominating set with size bounded from above by an integer k or not, and we design an O *… (More)

- ‹
- 1
- ›