✦ LIBER ✦

A combinatorial algorithm for weighted stable sets in bipartite graphs

✍ Scribed by Ulrich Faigle; Gereon Frahling

Book ID: 108112546
Publisher: Elsevier Science
Year: 2006
Tongue: English
Weight: 211 KB
Volume: 154
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2005.05.037

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

d-Transversals of stable sets and vertex

d-Transversals of stable sets and vertex covers in weighted bipartite graphs

✍ Bentz, C.; Costa, M.-C.; Picouleau, C.; Ries, B.; de Werra, D. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Algorithms for Maximum Independent Set i

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

✍ José Soares; Marco A. Stefanes 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 371 KB

A Combinatorial Algorithm for Minimum We

A Combinatorial Algorithm for Minimum Weighted Colorings of Claw-Free Perfect Graphs

✍ Xueliang Li; Wenan Zang 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 215 KB

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 -approximation algorithm for minimum w

A -approximation algorithm for minimum weighted dominating set in unit disk graph

✍ Decheng Dai; Changyuan Yu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 919 KB

A linear time algorithm for maximum matc

A linear time algorithm for maximum matchings in convex, bipartite graphs

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB