✦ LIBER ✦

Branch and bound algorithms for the maximum clique problem under a unified framework

✍ Scribed by Carmo, Renato; Züge, Alexandre

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for the max

✍ L. Babel; G. Tinhofer 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 451 KB

An efficient branch-and-bound algorithm

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 95 KB

An Efficient Branch-and-bound Algorithm

✍ Etsuji Tomita; Toshikatsu Kameda 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 227 KB

A fast algorithm for the maximum weight

✍ L. Babel 📂 Article 📅 1994 🏛 Springer Vienna 🌐 English ⚖ 386 KB

A New Algorithm for the Maximum-Weight C

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

The maximum clique enumeration problem:

✍ Eblen, John D; Phillips, Charles A; Rogers, Gary L; Langston, Michael A 📂 Article 📅 2012 🏛 BioMed Central 🌐 English ⚖ 664 KB