|
|
Автор: Jesse Russel
Год: 2012
Издание:
Книга по Требованию
Страниц: 82
ISBN: 9785511099767
High Quality Content by WIKIPEDIA articles! In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical optimization problem in computer science and is a typical example of an NP-hard optimization problem that has an approximation algorithm. Its decision version, the vertex cover problem, was one of Karp's 21 NP-complete problems and is therefore a classical NP-complete problem in computational complexity theory. Furthermore, the vertex cover problem is fixed-parameter tractable and a central problem in parameterized complexity theory. Данное издание представляет собой компиляцию сведений, находящихся в свободном доступе в среде Интернет в целом, и в информационном сетевом ресурсе "Википедия" в частности. Собранная по частотным запросам указанной тематики, данная компиляция построена по принципу подбора близких...
|
|
Varietez Ingenieuses: Ou Recueil Et Melange De Pieces Serieuses Et Amusantes (French Edition)
Jesse RusselVertex cover
Jesse RusselRachel Cooper