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

A polynomial algorithm for the parity path problem on perfectly orientable graphs

โœ Scribed by Srinivasa R. Arikati; Uri N. Peled

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

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

A polynomial algorithm for the minimum w
A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs
โœ Wen-Lian HSU; George L. Nemhauser ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection