✦ LIBER ✦

Independent Sets in Circular-Arc Graphs

✍ Scribed by W.L. Hsu; J.P. Spinrad

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 755 KB
Volume: 19
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1995.1031

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum independent sets of circular-arc

Maximum independent sets of circular-arc graphs: Simplified algorithm and proofs

✍ Zheng, S. Q. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 421 KB 👁 2 views

We present a simple optimal algorithm for the problem of finding maximum independent sets of circular-arc graphs. Given an intersection model S of a circular-arc graph G , our algorithm computes a maximum independent set of G in O ( n ) space and O ( n ) or O(n log n ) time, depending on whether the

Maximal independent sets in bipartite gr

Maximal independent sets in bipartite graphs

✍ Jiuqiang Liu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 458 KB 👁 1 views

## Abstract A maximal independent set of a graph __G__ is an independent set that is not contained properly in any other independent set of __G.__ In this paper, we determine the maximum number of maximal independent sets among all bipartite graphs of order __n__ and the extremal graphs as well as

Independent sets in random sparse graphs

✍ Pedro G. Gazmuri 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 418 KB

Independent sets in graphs with triangle

Independent sets in graphs with triangles

✍ Thomas Hofmeister; Hanno Lefmann 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 387 KB

On unique independent sets in graphs

✍ Werner Siemes; Jerzy Topp; Lutz Volkmann 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 483 KB

Algorithms on circular-arc graphs

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