✦ LIBER ✦

On Algorithms for Obtaining a Maximum Transversal

✍ Scribed by Duff, I. S.

Book ID: 115490077
Publisher: Association for Computing Machinery
Year: 1981
Tongue: English
Weight: 921 KB
Volume: 7
Category: Article
ISSN: 0098-3500
DOI: 10.1145/355958.355963

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Discussion on Two Algorithms for Deter

A Discussion on Two Algorithms for Determining Maximum Compatibles

✍ Handoko, F. 📂 Article 📅 1975 🏛 IEEE 🌐 English ⚖ 711 KB

A distributed algorithm for maximum flow

A distributed algorithm for maximum flow on processor-arrays

✍ Kenji Onaga; Satoshi Marumoto 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 680 KB

A simple, efficient algorithm for maximu

A simple, efficient algorithm for maximum finding on rings

✍ Lisa Higham; Teresa Przytycka 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

On the maximum capacity augmentation alg

On the maximum capacity augmentation algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 489 KB

New algorithms for the weighted maximum

New algorithms for the weighted maximum cut problem on graphs

✍ N. Z. Shor; O. A. Berezovskii 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 360 KB

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