✦ LIBER ✦

On the Maximum Uniquely Restricted Matching for Bipartite Graphs

✍ Scribed by Sounaka Mishra

Book ID: 108120820
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 202 KB
Volume: 37
Category: Article
ISSN: 1571-0653
DOI: 10.1016/j.endm.2011.05.059

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local maximum stable sets in bipartite g

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings

✍ Vadim E. Levit; Eugen Mandrescu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 233 KB

A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ (G), if S is a maximum stable set of the subgraph spanned by S ∪ N (S), where N (S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce

On maximum induced matchings in bipartit

On maximum induced matchings in bipartite graphs

✍ V.V. Lozin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 75 KB

DNA Computing of Bipartite Graphs for Ma

DNA Computing of Bipartite Graphs for Maximum Matching

✍ Shiying Wang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 101 KB

Finding maximum matching for bipartite g

Finding maximum matching for bipartite graphs in parallel

✍ Pranay Chaudhuri 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 148 KB

Finding a complete matching with the max

Finding a complete matching with the maximum product on weighted bipartite graphs

✍ Frank S.C. Tseng; Wei-Pang Yang; Arbee L.P. Chen 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 352 KB

Triangle-free graphs with uniquely restr

Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids

✍ V.E. Levit; Eugen Mandrescu 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 233 KB