-
Anglický jazyk
Vertex Cover
Autor: Lambert M. Surhone
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... Viac o knihe
Na objednávku, dodanie 2-4 týždne
152.38 €
bežná cena: 160.40 €
O knihe
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. The minimum vertex cover problem can be formulated as a half-integral linear program whose dual linear program is the maximum matching problem.
- Vydavateľstvo: OmniScriptum
- Rok vydania: 2026
- Formát: Paperback
- Rozmer: 220 x 150 mm
- Jazyk: Anglický jazyk
- ISBN: 9786130356521
