✦ LIBER ✦

Finding a Maximal Weighted Independent Set in Wireless Networks

✍ Scribed by Stefano Basagni

Book ID: 110353965
Publisher: Springer US
Year: 2001
Tongue: English
Weight: 107 KB
Volume: 18
Category: Article
ISSN: 1018-4864
DOI: 10.1023/a:1016747704458

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple proof that finding a maximal in

A simple proof that finding a maximal independent set in a graph is in

✍ Aaron Windsor 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 81 KB

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

Fixed points and maximal independent set

Fixed points and maximal independent sets in AND–OR networks

✍ Julio Aracena; Jacques Demongeot; Eric Goles 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A Note on the Approximation of a Minimum

A Note on the Approximation of a Minimum-Weight Maximal Independent Set

✍ Marc Demange 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 84 KB

Finding a maximum independent set in a p

Finding a maximum independent set in a permutation graph

✍ Haklin Kim 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 374 KB