FREE SHIPPING - SAFE PAYMENT - MONEY BACK GUARANTEE Need help?

Vertex Cover

by Lambert M. Surhone - Sold by Dodax EU
State: New
£26.60
VAT included - FREE Shipping
Lambert M. Surhone Vertex Cover
Lambert M. Surhone - Vertex Cover

Do you like this product? Spread the word!

£26.60 incl. VAT
Only 1 items available Only 1 items available
Delivery: between 2021-03-10 and 2021-03-12
Sales & Shipping: Dodax EU

Description

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.

Contributors

Editor Lambert M. Surhone

Editor Miriam T. Timpledon

Editor Susan F. Marseken

Product Details

DUIN 1NQK7UE3JJ2

GTIN 9786130356521

Pages 104

Product type Paperback

£26.60
We use cookies on our website to make our services more efficient and more user-friendly. Therefore please select "Accept cookies"! Please read our Privacy Policy for further information.