Vertex Cover: Mathematics, Graph Theory, Graph, Optimization Problem, NP-Hard, Approximation Algorithm, Karp's 21 NP-Complete Problems, Computational Complexity Theory, Parameterized Complexity - Couverture souple

Couverture souple

ISBN 10 : 6130356528 ISBN 13 : 9786130356521

Editeur : Betascript Publishing, 2010

Synopsis

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.

Détails de l'édition

• Éditeur: Betascript Publishing
• Date d'édition: 2010
• Langue: anglais
• ISBN 10: 6130356528
• ISBN 13: 9786130356521
• Reliure: Broché
• Nombre de pages: 104
• Éditeur: Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
• Coordonnées du fabricant: non disponible
• Personne responsable: non disponible