๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Finding cliques of maximum weight on a generalization of permutation graphs

โœ Scribed by Valentina Cacchiani, Alberto Caprara, Paolo Toth

Book ID
118815459
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
161 KB
Volume
7
Category
Article
ISSN
1862-4472

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc