𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Clique Problem in Intersection Graphs of Ellipses and Triangles

✍ Scribed by Christoph Ambühl; Uli Wagner

Book ID
105914801
Publisher
Springer
Year
2005
Tongue
English
Weight
316 KB
Volume
38
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The max clique problem in classes of str
The max clique problem in classes of string-graphs
✍ M. Middendorf; F. Pfeiffer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 378 KB

Middendorf, M., F. Pfeiffer, The max clique problem in classes of string-graphs, Discrete Mathematics 108 (1992) 365-372. A string-graph is an intersection graph of a set of curves in the plane. Investigating the complexity of the max clique problem for some classes of string-graphs we obtain NPcomp

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