✦ LIBER ✦

Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs

✍ Scribed by Noga Alon; Shai Gutner

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Homogeneous sets and domination: A linea

✍ Falk Nicolai; Thomas Szymczak 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

A linear algorithm for finding a minimum

✍ S.T Hedetniemi; Renu Laskar; John Pfaff 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 312 KB

A linear time algorithm for finding all

✍ Ting-Yem Ho; Yue-Li Wang; Ming-Tsan Juan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 488 KB

Analysis of a greedy heuristic for findi

✍ Abhay K. Parekh 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A linear-time algorithm for finding a sp

✍ Hiroshi Nagamochi; Toshihide Ibaraki 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 684 KB

A Linear Time Algorithm for the Minimum-

✍ Shao-qiang Zhang; Guo-jun Li; Shu-guang Li 📂 Article 📅 2004 🏛 Institute of Applied Mathematics, Chinese Academy 🌐 English ⚖ 169 KB