✦ LIBER ✦

The combinatorics of pivoting for the maximum weight clique

✍ Scribed by Marco Locatelli; Immanuel M Bomze; Marcello Pelillo

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 207 KB
Volume: 32
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.02.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Algorithm for the Maximum-Weight C

A New Algorithm for the Maximum-Weight Clique Problem

✍ Patric R.J. Östergård 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 72 KB

Hard graphs for the maximum clique probl

Hard graphs for the maximum clique problem

✍ Cornelis Hoede 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 299 KB

An exact algorithm for the maximum cliqu

An exact algorithm for the maximum clique problem

✍ Randy Carraghan; Panos M. Pardalos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 358 KB

A parallel algorithm for finding a maxim

A parallel algorithm for finding a maximum weight clique of an interval graph

✍ Chii-Huah Shyu 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 339 KB

A multi-KP modeling for the maximum-cliq

A multi-KP modeling for the maximum-clique problem

✍ Federico Della Croce; Roberto Tadei 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 478 KB

The maximum number of cliques in dense g

The maximum number of cliques in dense graphs

✍ Bruce Hedman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 372 KB

Denote the number of vertices of G by ]G[. A clique of graph G is a maximal complete subgraph. The density oJ(G) is the number of vertices in the largest clique of G. If ¢o(G)>~½ ]GI, then G has at most 2 t°l-'cG) cliques. The extremal graphs are then examined as wen. ## Terminology We will be co