✦ LIBER ✦

Solving the single step graph searching problem by solving the maximum two-independent set problem

✍ Scribed by Ju Yuan Hsiao; Chuan Yi Tang; Ruay Shiung Chang

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 622 KB
Volume: 40
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90124-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Using critical sets to solve the maximum

Using critical sets to solve the maximum independent set problem

✍ Sergiy Butenko; Svyatoslav Trukhanov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 139 KB

A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The effectiveness of the proposed approach on large graphs with large independence number is demonstrated

A natural model and a parallel algorithm

A natural model and a parallel algorithm for approximately solving the maximum weighted independent set problem

✍ Mohamed Afif; Aristidis Likas; Vangelis Th. Paschos 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 535 KB