✦ LIBER ✦

Algorithms on circular-arc graphs

✍ Scribed by F. Gavril

Publisher: John Wiley and Sons
Year: 1974
Tongue: English
Weight: 596 KB
Volume: 4
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230040407

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time algorithms on circular-a

Polynomial time algorithms on circular-arc overlap graphs

✍ Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

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

On chordal proper circular arc graphs

✍ Jørgen Bang-Jensen; Pavol Hell 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Lexicographic orientation and representa

Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs

✍ Pavon Hell; Jing Huang 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 823 KB

## Abstract We introduce a simple new technique which allows us to solve several problems that can be formulated as seeking a suitable orientation of a given undirected graph. In particular, we use this technique to recognize and transitively orient comparability graphs, to recognize and represent

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

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