✦ LIBER ✦

On local maximum stable set greedoids

✍ Scribed by Vadim E. Levit; Eugen Mandrescu

Book ID: 113567319
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 292 KB
Volume: 312
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2011.04.015

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local maximum stable set greedoids stemm

Local maximum stable set greedoids stemming from very well-covered graphs

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

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 internally stable sets of a g

On maximum internally stable sets of a graph

✍ U. J. Nieminen 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 270 KB

Maximum stable set formulations and heur

Maximum stable set formulations and heuristics based on continuous optimization

✍ Samuel Burer; Renato D.C. Monteiro; Yin Zhang 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 228 KB

Maximum internally stable sets of a grap

Maximum internally stable sets of a graph

✍ S.L Hakimi; H Frank 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 711 KB

Handelman’s hierarchy for the maximum st

Handelman’s hierarchy for the maximum stable set problem

✍ Laurent, Monique; Sun, Zhao 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 474 KB