✦ LIBER ✦

Laplacian spectrum analysis and spanning tree algorithm for circuit partitioning problems

✍ Scribed by Huazhong Yang; Guanzhang Hu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for the connected co

✍ Dhruva Nath; S.N. Maheshwari 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 657 KB

Reformulations and solution algorithms f

✍ Abilio Lucena; Nelson Maculan; Luidi Simonetti 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 315 KB

The generalized minimum spanning tree pr

✍ Corinne Feremans; Martine Labbé; Gilbert Laporte 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 209 KB 👁 1 views

A branch and bound algorithm for the cap

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

A Survey on Algorithms for the Maximum I

✍ Gábor Salamon 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 224 KB

The competitiveness of randomized algori

✍ Ying Teh Tsai; Chuan Yi Tang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 373 KB