𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Maximum Clique Problem in Multiple Interval Graphs

✍ Scribed by Francis, Mathew C.; Gonçalves, Daniel; Ochem, Pascal

Book ID
121624721
Publisher
Springer
Year
2013
Tongue
English
Weight
981 KB
Volume
71
Category
Article
ISSN
0178-4617

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

The maximum ratio clique problem
The maximum ratio clique problem
✍ Sethuraman, Samyukta; Butenko, Sergiy 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 240 KB
Optimization problems in multiple-interv
Optimization problems in multiple-interval graphs
✍ Butman, Ayelet; Hermelin, Danny; Lewenstein, Moshe; Rawitz, Dror 📂 Article 📅 2010 🏛 Association for Computing Machinery 🌐 English ⚖ 330 KB

Multiple-interval graphs are a natural generalization of interval graphs where each vertex may have more then one interval associated with it. We initiate the study of optimization problems in multiple-interval graphs by considering three classical problems: Minimum Vertex Cover, Minimum Dominating