#### Filter Results:

#### Publication Year

2005

2014

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

For a fixed positive integer k, a k-tuple total dominating set of a graph G is a subset D ⊆ V (G) such that every vertex of G is adjacent to at least k vertices in D. The k-tuple total domination problem is to determine a minimum k-tuple total dominating set of G. This paper studies k-tuple total domination from an algorithmic point of view. In particular,… (More)

- ‹
- 1
- ›