✦ LIBER ✦

Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph

✍ Scribed by Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 760 KB
Volume: 13
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(92)90012-2

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

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

On the Maximum Number of Independent Cyc

On the Maximum Number of Independent Cycles in a Bipartite Graph

✍ Hong Wang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 404 KB

Let G=(V 1 , V 2 ; E ) be a bipartite graph with |V 1 |= |V 2 | =n 2k, where k is a positive integer. Suppose that the minimum degree of G is at least k+1. We show that if n>2k, then G contains k vertex-disjoint cycles. We also show that if n=2k, then G contains k&1 quadrilaterals and a path of orde

Maximum genus and maximum nonseparating

Maximum genus and maximum nonseparating independent set of a 3-regular graph

✍ Yuangqiu Huang; Yanpei Liu 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 440 KB

A set J C V is called a nonseparating independent set (nsis) of a connected graph G = (V, E), if J is an independent set of G, i.e., E A {uv [ Vu, v E J} = 0, and G -J is connected. We call z(G) = maxJ{lJ[ tJ is an nsis of G} the nsis number of G. Let G be a 3-regular connected graph; we prove that

A generalization of chordal graphs and t

A generalization of chordal graphs and the maximum clique problem

✍ Assef Chmeiss; Philippe Jégou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 584 KB

A graph is chordal or triangulated if it has no chordless cycle with four or more vertices. Chordal graphs are well known for their combinatorial and algorithmic properties. Here we introduce a generalization of chordal graphs, namely CSGk graphs. Informally, a CSG' graph is a complete graph, and fo

Maximum internally stable sets of a grap

Maximum internally stable sets of a graph

✍ S.L Hakimi; H Frank 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 711 KB