✦ LIBER ✦

Maximum weight independent set in trees

✍ Scribed by S. Pawagi

Publisher: Springer Netherlands
Year: 1987
Tongue: English
Weight: 35 KB
Volume: 27
Category: Article
ISSN: 0006-3835
DOI: 10.1007/bf01937282

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

✍ Shaunak Pawagi 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 720 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

The structure and maximum number of maxi

The structure and maximum number of maximum independent sets in trees

✍ Jennifer Zito 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 732 KB

A subset of vertices is a maximum independent set if no two of the vertices are joined by an edge and the subset has maximum cardinality. In this paper we answer a question posed by Herb Wilf. We show that the greatest number of maximum independent sets for a tree of n vertices is 2(n-3\* for odd n

The weighted maximum independent set pro

The weighted maximum independent set problem in permutation graphs

✍ Chang-Wu Yu; Gen-Huey Chen 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 543 KB

Maximum weight independent set of circul

Maximum weight independent set of circular-arc graph and its application

✍ Swagata Mandal; Madhumangal Pal 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 221 KB

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