✦ LIBER ✦

An Efficient Branch-and-bound Algorithm for Finding a Maximum Clique with Computational Experiments

✍ Scribed by Etsuji Tomita; Toshikatsu Kameda

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

A branch and bound algorithm for the max

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

Computational results with a branch-and-

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

An efficient and reliable algorithm for

✍ Sabine Van Huffel; Joos Vandewalle; Ann Haegemans 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 1020 KB