𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm for a maximum clique of the intersection graph of isooriented rectangles on a cylinder

✍ Scribed by Takashi Kizu; Toshiro Araki; Toshinobu Kashiwabara

Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
624 KB
Volume
79
Category
Article
ISSN
1042-0967

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

An upper bound on the size of a largest
An upper bound on the size of a largest clique in a graph
✍ Dennis P. Geoffroy; David P. Sumner πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 1 views

## Abstract A graph is point determining if distinct vertices have distinct neighborhoods. The nucleus of a point‐determining graph is the set __G__^O^ of all vertices, __v__, such that __G__–__v__ is point determining. In this paper we show that the size, Ο‰(__G__), of a maximum clique in __G__ sat

An upper bound on the size of the larges
An upper bound on the size of the largest cliques in a graph
✍ Alain Billionnet πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 194 KB πŸ‘ 1 views

## Abstract We produce in this paper an upper bound for the number of vertices existing in a clique of maximum cardinal. The proof is based in particular on the existence of a maximum cardinal clique that contains no vertex __x__ such that the neighborhood of __x__ is contained in the neighborhood

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the