𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fan growing algorithm for efficient vertex caching

✍ Scribed by T Franzetti; A.M Day; D.B Arnold

Book ID
114109610
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
734 KB
Volume
27
Category
Article
ISSN
0097-8493

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An Efficient Exact Algorithm for Constra
An Efficient Exact Algorithm for Constraint Bipartite Vertex Cover
✍ Henning Fernau; Rolf Niedermeier πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 382 KB

The constraint bipartite vertex cover problem (CBVC for short) is as follows: given a bipartite graph G with n vertices and two positive integers k 1 k 2 , is there a vertex cover taking at most k 1 vertices from one and at most k 2 vertices from the other vertex set of G? CBVC is NP-complete. It fo