ABSTRACT
ln the last quarter of the century there has been a growing interest in the design and analysis of algorithms in different branches of mathematics, science and engineering. In particular, within the past 15 years there has appeared a wealth of literature on algorithms in graph theory, a significant part of which is related to domination in graphs. Since there are well over one hundred papers on domination or domination-related algorithms, this chapter will necessarily have to focus on a limited collection of these algorithms.
