Vertex Cover

ISBN 13: 9786130356521

Vertex Cover

 
9786130356521: Vertex Cover
Ver todas las copias de esta edición ISBN.
 
 
Reseña del editor:

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. 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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Comprar nuevo Ver este artículo

Gastos de envío: EUR 17,13
De Alemania a Estados Unidos de America

Destinos, gastos y plazos de envío

Añadir al carrito

Los mejores resultados en AbeBooks

Imagen de archivo

1.

Lambert M. Surhone
Publicado por Betascript Publishers Feb 2010 (2010)
ISBN 10: 6130356528 ISBN 13: 9786130356521
Nuevo Taschenbuch Cantidad disponible: 1
Librería
BuchWeltWeit Inh. Ludwig Meier e.K.
(Bergisch Gladbach, Alemania)

Descripción Betascript Publishers Feb 2010, 2010. Taschenbuch. Condición: Neu. Neuware - 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. 104 pp. Englisch. Nº de ref. del artículo: 9786130356521

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 39,00
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 17,13
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío
Imagen de archivo

2.

Lambert M. Surhone
Publicado por Betascript Publishers Feb 2010 (2010)
ISBN 10: 6130356528 ISBN 13: 9786130356521
Nuevo Taschenbuch Cantidad disponible: 1
Librería
Rheinberg-Buch
(Bergisch Gladbach, Alemania)

Descripción Betascript Publishers Feb 2010, 2010. Taschenbuch. Condición: Neu. Neuware - 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. 104 pp. Englisch. Nº de ref. del artículo: 9786130356521

Más información sobre este vendedor | Contactar al vendedor

Comprar nuevo
EUR 39,00
Convertir moneda

Añadir al carrito

Gastos de envío: EUR 17,13
De Alemania a Estados Unidos de America
Destinos, gastos y plazos de envío