# Ken Iwaide

- Citations Per Year

- Citations Per Year

- Full text PDF available (1)

2015

2017

- This year (1)
- Last 5 years (2)
- Last 10 years (2)

Learn More

- Ken Iwaide, Hiroshi Nagamochi
- J. Graph Algorithms Appl.
- 2015

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… (More)

- Ken Iwaide, Hiroshi Nagamochi
- IEICE Transactions
- 2017

- ‹
- 1
- ›