๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding a maximum independent set in a permutation graph

โœ Scribed by Haklin Kim

Publisher
Elsevier Science
Year
1990
Tongue
English
Weight
374 KB
Volume
36
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The Cardinality of the Collection of Max
The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph
โœ Shu-Chu Chang; Yeong-Nan Yeh ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 226 KB

An independent set or stable set of a graph G V, E is a subset S of the ลฝ . vertices set V in which no two are adjacent. Let G be the number of vertices in ลฝ . a stable set of maximum cardinality; G is called the stability number of G. Stability numbers of a graph have been well studied, but little

Maximal and maximum independent sets in
Maximal and maximum independent sets in graphs with at most r cycles
โœ Bruce E. Sagan; Vincent R. Vatter ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 236 KB ๐Ÿ‘ 2 views

## Abstract Let __m__(__G__) denote the number of maximal independent sets of vertices in a graph __G__ and let __c__(__n__,__r__) be the maximum value of __m__(__G__) over all connected graphs with __n__ vertices and at most __r__ cycles. A theorem of Griggs, Grinstead, and Guichard gives a formul