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

The algorithmic complexity of bondage and reinforcement problems in bipartite graphs

โœ Scribed by Hu, Fu-Tao; Sohn, Moo Young

Book ID
122241333
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
301 KB
Volume
535
Category
Article
ISSN
0304-3975

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

[Lecture Notes in Computer Science] Algo
[Lecture Notes in Computer Science] Algorithms and Complexity Volume 6078 || Packing Bipartite Graphs with Covers of Complete Bipartite Graphs
โœ Calamoneri, Tiziana; Diaz, Josep ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ German โš– 227 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Conference On Algorithms And Computation, Ciac 2010, Held In Rome, Italy, In May 2010. The 30 Revised Full Papers Presented Together With 3 Invited Papers Were Carefully Reviewed And Selected From 114 Submissions. Among The Topi