๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Strongly polynomial simplex algorithm for bipartite vertex packing

โœ Scribed by Ronald D. Armstrong; Zhiying Jin

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
426 KB
Volume
64
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Algorithm for the vertex packing problem
Algorithm for the vertex packing problem
โœ Yu. V. Voitishin; E. A. Sharkovskaya ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer US ๐ŸŒ English โš– 184 KB
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

A polynomial algorithm for the extendabi
A polynomial algorithm for the extendability problem in bipartite graphs
โœ J. Lakhal; L. Litzler ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 587 KB

Let G = [ y E] be a simple connected graph and let k be an integer such that 0 < k < 1 VI /2. G is said to be k-extendable if it contains a perfect matching and every matching of k edges extends to, i.e. is a subset of, a perfect matching. The extendability problem consists in finding the maximum va