𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A set of strategy-independent restructuring algorithms

✍ Scribed by Makoto Kobayashi

Book ID
112209487
Publisher
John Wiley and Sons
Year
1977
Tongue
English
Weight
687 KB
Volume
7
Category
Article
ISSN
0038-0644

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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