✦ LIBER ✦

The densestk-subgraph problem on clique graphs

✍ Scribed by Maria Liazi; Ioannis Milis; Fanny Pascual; Vassilis Zissimopoulos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subgraph extraction and metaheuristics f

✍ Duc-Cuong Dang, Aziz Moukrim 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 877 KB

The clique problem for planar graphs

✍ Christos H. Papadimitriou; Mihalis Yannakakis 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 326 KB

The subgraph isomorphism problem for out

✍ Maciej M. SysŁ;o 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 702 KB

Hard graphs for the maximum clique probl

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

On graphs with polynomially solvable max

✍ Egon Balas; Chang Sung Yu 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 319 KB

Approximating the maximum clique minor a

✍ Noga Alon; Andrzej Lingas; Martin Wahlen 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 329 KB