Vertex Cover
CHF 53.20
Auf Lager
SKU
GJLM0SKA1BD
1 Verfügbar 
Kostenloser Versand
Geliefert zwischen Mi., 08.10.2025 und Do., 09.10.2025
Details
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.
30 Tage Rückgaberecht
GarantieWeitere Informationen
- Allgemeine Informationen
- GTIN 09786130356521
- Editor Lambert M. Surhone, Miriam T. Timpledon, Susan F. Marseken
- Sprache Englisch
- Größe H220mm x B150mm x T6mm
- Jahr 2010
- EAN 9786130356521
- Format Fachbuch
- ISBN 978-613-0-35652-1
- Titel Vertex Cover
- Untertitel Mathematics, Graph Theory, Graph, Optimization Problem, NP-Hard, Approximation Algorithm, Karp's 21 NP-Complete Problems, Computational Complexity Theory, Parameterized Complexity
- Gewicht 173g
- Herausgeber VDM Verlag Dr. Müller e.K.
- Anzahl Seiten 104
- Genre Mathematik
Bewertungen
Schreiben Sie eine Bewertung
