✦ LIBER ✦

An approximation algorithm for the maximum independent set problem in cubic planar graphs

✍ Scribed by Elarbi Choukhmane; John Franco

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 289 KB
Volume: 16
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230160402

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The maximum independent set problem for

The maximum independent set problem for cubic planar graphs

✍ James E. Burns 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 286 KB

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

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

AnO(m + n log n) Alg

AnO(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs

✍ Binay K. Bhattacharya; Damon Kaller 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 338 KB

We present an algorithm to compute, in O m q n log n time, a maximum clique Ž . in circular-arc graphs with n vertices and m edges provided a circular-arc model of the graph is given. If the circular-arc endpoints are given in sorted order, the Ž . time complexity is O m . The algorithm operates on