✦ LIBER ✦

A branch and bound algorithm for the maximum clique problem

✍ Scribed by L. Babel; G. Tinhofer

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

An exact algorithm for the maximum cliqu

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

A branch and bound algorithm for the acy

✍ R. Kaas 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 612 KB