## Algorithmic aspects of domination in graphs (1998)

Venue: | in: Handbook of Combinatorial Optimization (D.-Z. Du and P. M. Pardalos eds |

Citations: | 6 - 2 self |

### BibTeX

@INPROCEEDINGS{Chang98algorithmicaspects,

author = {Gerard J. Chang},

title = {Algorithmic aspects of domination in graphs},

booktitle = {in: Handbook of Combinatorial Optimization (D.-Z. Du and P. M. Pardalos eds},

year = {1998},

pages = {339--405}

}

### OpenURL

### Abstract

Graph theory was founded by Euler [78] in 1736 as a generalization to the solution of the famous problem of the Könisberg bridges. From 1736 to 1936, the same concept as graph, but under different names, was used in various scientific fields as models of real world problems, see the historic book by Biggs, Lloyd and Wilson [19]. This chapter intents to survey the domination problem in graph theory, which is a natural model for many location problems in operations research, from an algorithmic point of view. 1