✦ LIBER ✦

A new backtracking algorithm for generating the family of maximal independent sets of a graph

✍ Scribed by E. Loukakis

Book ID: 108020107
Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 636 KB
Volume: 9
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(83)90115-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A depth first search algorithm to genera

A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically

✍ E. Loukakis; C. Tsouros 📂 Article 📅 1981 🏛 Springer Vienna 🌐 English ⚖ 809 KB

The number of maximal independent sets i

The number of maximal independent sets in a connected graph

✍ Jerrold R. Griggs; Charles M. Grinstead; David R. Guichard 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1021 KB

We determine the maximum on n vertices can have, and we a question of Wilf. number of maximal independent sets which a connected graph completely characterize the extremal graphs, thereby answering \* Partially supported by NSF grant number DIMS-8401281. t Partially supported by NSF grant number D S

Fast algorithms for generating all maxim

Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs

✍ Joseph Y.-T Leung 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 811 KB

A polynomial algorithm for constructing

A polynomial algorithm for constructing families of k-independent sets

✍ G. Freiman; E. Lipkin; L. Levitin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 1003 KB

The present paper describes an algorithm for constructing families of k-independent subsets & of {1,2, . . . , n} with &I >2ck", where c, = d/(k -1)2& and d is a certain constant. The algorithm has a polynomial complexity with respect to the size of the family constructed.

Algorithms for a maximum clique and a ma

Algorithms for a maximum clique and a maximum independent set of a circle graph

✍ F. Gavril 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 523 KB

## Abstract Consider a family of chords in a circle. A circle graph is obtained by representing each chord by a vertex, two vertices being connected by an edge when the corresponding chords intersect. In this paper, we describe efficient algorithms for finding a maximum clique and a maximum indepen

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