✦ LIBER ✦

A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number

✍ Scribed by Sukegawa, Noriyoshi; Miyauchi, Atsushi

Book ID: 122061858
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 312 KB
Volume: 10
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2013.08.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of an approximate greedy algori

Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem

✍ Abraham P. Punnen; Ruonan Zhang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 186 KB

The maximum number of q-cliques in a gra

The maximum number of q-cliques in a graph with no p-clique

✍ Steven Roman 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 805 KB

On the Maximum Number of Cliques in a Gr

On the Maximum Number of Cliques in a Graph

✍ David R. Wood 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 192 KB

On the number of distinct minimal clique

On the number of distinct minimal clique partitions and clique covers of a line graph

✍ Sean McGuinness; Rolf Rees 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 812 KB

Let G be a line graph. Orlin determined the clique covering and clique partition numbers cc(G) and cp(G). We obtain a constructive proof of Orlin's result and in doing so we are able to completely enumerate the number of distinct minimal clique covers and partitions of G, in terms of easily calculab

A note on the approximation of the max c

A note on the approximation of the max clique problem

✍ P. Crescenzi; C. Fiorini; R. Silvestri 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 312 KB

Upper bounds on the edge clique cover nu

Upper bounds on the edge clique cover number of a graph

✍ Robert C. Brigham; Ronald D. Dutton 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 521 KB