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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of applied and industrial mathematics Ročník 11; číslo 1; s. 99 - 106
Hlavní autor:	Malyshev, D. S.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Moscow Pleiades Publishing 01.01.2017 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!