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 pape...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of applied and industrial mathematics Vol. 11; no. 1; pp. 99 - 106
Main Author:	Malyshev, D. S.
Format:	Journal Article
Language:	English
Published:	Moscow Pleiades Publishing 01.01.2017 Springer Nature B.V
Subjects:	Algorithms Approximation Bandwidth Bandwidths Boundaries Boundary conditions Computer programs Descriptions Graph theory Graphs Mathematical analysis Mathematical models Mathematics Mathematics and Statistics Studies hereditary class critical class efficient algorithm computational complexity
ISSN:	1990-4789, 1990-4797
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!