Schaudt, Oliver
(2011).
Efficient total domination in digraphs.
Working Paper.
|
PDF
zaik2011-611.pdf Download (157kB) | Preview |
Abstract
We generalize the concept of efficient total domination from graphs to digraphs. An efficiently total dominating set X of a digraph D is a vertex subset such that every vertex of D has exactly one predecessor in X . Not every digraph has an efficiently total dominating set. We study graphs that permit an orientation having such a set and give complexity results and characterizations concerning this question. Furthermore, we study the computational complexity of the (weighted) efficient total domination problem for several digraph classes. In particular we deal with most of the common generalizations of tournaments, like locally semicomplete and arc-locally semicomplete digraphs.
| Item Type: | Preprints, Working Papers or Reports (Working Paper) | ||||||||
| Creators: |
|
||||||||
| URN: | urn:nbn:de:hbz:38-550041 | ||||||||
| Date: | 2011 | ||||||||
| Language: | English | ||||||||
| Faculty: | Faculty of Mathematics and Natural Sciences | ||||||||
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science | ||||||||
| Subjects: | Data processing Computer science | ||||||||
| Refereed: | No | ||||||||
| URI: | http://kups.ub.uni-koeln.de/id/eprint/55004 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |