VERTEX COVER—AN ILLUSTRATIVE EXAMPLE
Rolf Niedermeier · 2006
Abstract This chapter illustrates many facets of fixed-parameter algorithmics using the graph problem, Vertex Cover. These include problem parameterization, aspects of special and more general problem formulations, topics concerning counting and enumeration, lower bound questions, and also practical aspects. Finally, the use of ‘Vertex Cover structure’ for other problems is considered.