✦ LIBER ✦

Genetic algorithmic approach to find the maximum weight independent set of a graph

✍ Scribed by Sk. Md. Abu Nayeem; Madhumangal Pal

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 213 KB
Volume: 25
Category: Article
ISSN: 1598-5865
DOI: 10.1007/bf02832348

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms to find the maximum set of pa

Algorithms to find the maximum set of pairwise incomparable weighted vertices in a directed acyclic graph

✍ Yu. V. Voitishin 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 415 KB

An optimal time algorithm for finding a

An optimal time algorithm for finding a maximum weight independent set in a tree

✍ G. H. Chen; M. T. Kuo; J. P. Sheu 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 147 KB

Sequential and parallel algorithms for t

Sequential and parallel algorithms for the maximum-weight independent set problem on permutation graphs

✍ Ming-Shing Yu; Lin Yu Tseng; Shoe-Jane Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 428 KB

Algorithms for a maximum clique and a ma

Algorithms for a maximum clique and a maximum independent set of a circle graph

✍ F. Gavril 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen

A branch-and-price approach for the maxi

A branch-and-price approach for the maximum weight independent set problem

✍ Deepak Warrier; Wilbert E. Wilhelm; Jeffrey S. Warren; Illya V. Hicks 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 124 KB

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