✦ LIBER ✦

An algorithm for finding a large independent set in planar graphs

✍ Scribed by Norishige Chiba; Takao Nishizeki; Nobuji Saito

Publisher: John Wiley and Sons
Year: 1983
Tongue: English
Weight: 333 KB
Volume: 13
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230130209

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for the maxim

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

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

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

Decomposing a Planar Graph into an Indep

Decomposing a Planar Graph into an Independent Set and a 3-Degenerate Graph

✍ Carsten Thomassen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 126 KB

We prove the conjecture made by O. V. Borodin in 1976 that the vertex set of every planar graph can be decomposed into an independent set and a set inducing a 3-degenerate graph.

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

A Parallel Randomized Algorithm for Find

A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph

✍ Tomasz Łuczak; Edyta Szymańska 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We present a randomized parallel algorithm with polylogarithmic expected running time for finding a maximal independent set in a linear hypergraph.

Analysis of parallel algorithms for find

Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph

✍ H. Chen; A. M. Frieze 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study