Critical elements in combinatorially closed families of graph classes
The notions of boundary and minimal hard classes of graphs, united by the term “critical classes,” are useful tools for analysis of computational complexity of graph problems in the family of hereditary graph classes. In this family, boundary classes are known for several graph problems. In the paper, we consider critical graph classes in the families of strongly hereditary and minor closed graph classes. Prior to our study, there was the only one example of a graph problem for which boundary classes were completely described in the family of strongly hereditary classes. Moreover, no boundary classes were known for any graph problem in the family of minor closed classes. In this article, we present several complete descriptions of boundary classes for these two families and some classical graph problems. For the problem of 2-additive approximation of graph bandwidth, we find a boundary class in the family of minor closed classes. Critical classes are not known for this problem in the other two families of graph classes.
Keywordscomputational complexity hereditary class critical class efficient algorithm
Unable to display preview. Download preview PDF.
- 14.M. R. Fellows, D. Lokshtanov, N. Misra, F. A. Rosamond, and S. Saurabh, “Graph Layout Problems Parameterized by Vertex Cover,” in Algorithms and Computation (Proceedings of 19th International Symposium, Gold Coast, Australia, December 15–17, 2008) (Springer, Heidelberg, 2008), pp. 294–305.CrossRefGoogle Scholar