✦ LIBER ✦

A strengthened analysis of an algorithm for Dominating Set in planar graphs

✍ Scribed by Torben Hagerup

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A strengthened analysis of a local algor

✍ Wawrzyniak, Wojciech 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 278 KB

An algorithm for finding a large indepen

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views

An algorithm for reliability analysis of

✍ Daniel Blenstock 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 573 KB

An efficient parallel algorithm for comp

✍ Marek Chrobak; Joseph Naor 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 750 KB

An approximation algorithm for the maxim

✍ Elarbi Choukhmane; John Franco 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB 👁 1 views

An Algorithm for Testing the Planarity o

✍ Dunn, W.; Chan, S. 📂 Article 📅 1968 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 340 KB