✦ LIBER ✦

Polynomial time algorithms on circular-arc overlap graphs

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

Publisher: John Wiley and Sons
Year: 1991
Tongue: English
Weight: 417 KB
Volume: 21
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230210205

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient algorithms for interval graphs

Efficient algorithms for interval graphs and circular-arc graphs

✍ U. I. Gupta; D. T. Lee; J. Y.-T. Leung 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the

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

Efficient algorithms for centers and med

Efficient algorithms for centers and medians in interval and circular-arc graphs

✍ Sergei Bespamyatnikh; Binay Bhattacharya; Mark Keil; David Kirkpatrick; Michael 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 267 KB

## Abstract The __p__‐center problem is to locate __p__ facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The __p__‐median problem is to locate __p__ facilities on a network so as to minimize the average distance from a demand point to its c

A linear time algorithm to recognize cir

A linear time algorithm to recognize circular permutation graphs

✍ Sritharan, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea

Minimum Fill-in on Circle and Circular-A

Minimum Fill-in on Circle and Circular-Arc Graphs

✍ T Kloks; D Kratsch; C.K Wong 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 184 KB

We present two algorithms solving the minimum fill-in problem on circle graphs Ž 3 . and on circular-arc graphs in time O n .

The Christoffel Function for Orthogonal

The Christoffel Function for Orthogonal Polynomials on a Circular Arc

✍ Leonid Golinskii 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 103 KB

For the special type of weight functions on circular arc we study the asymptotic behavior of the Christoffel kernel off the arc and of the Christoffel function inside the arc. We prove Totik's conjecture for the Christoffel function corresponding to such weight functions.