✦ LIBER ✦

STABULUS: A technique for finding stable sets in large graphs with tabu search

✍ Scribed by C. Friden; A. Hertz; D. Werra

Publisher: Springer Vienna
Year: 1989
Tongue: English
Weight: 508 KB
Volume: 42
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02243141

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tabaris: An exact algorithm based on tab

Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

✍ C. Friden; A. Hertz; D. de Werra 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 809 KB

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

A sharp upper bound for the number of st

A sharp upper bound for the number of stable sets in graphs with given number of cut edges

✍ Hongbo Hua 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 648 KB

Let G be a connected and simple graph, and let i(G) denote the number of stable sets in G. In this letter, we have presented a sharp upper bound for the i(G)-value among the set of graphs with k cut edges for all possible values of k, and characterized the corresponding extremal graphs as well.