✦ LIBER ✦

Complexity of finding k-path-free dominating sets in graphs

✍ Scribed by Reuven Bar-Yehuda; Uzi Vishkin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of a greedy heuristic for findi

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

11/30 (Finding Large Independent Sets in

✍ K. Fraughnaugh; S.C. Locke 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 840 KB

The Complexity of Finding Paths in Graph

✍ Nickelsen, Arfst; Tantau, Till 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 289 KB

Linear Time Algorithms for Finding a Dom

✍ Noga Alon; Shai Gutner 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 310 KB

On the numbers of independent k-sets in

✍ Yahya Ould Hamidoune 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 184 KB

On weights of induced paths and cycles i

✍ J. Harant; M. Voigt; S. Jendrol; B. Randerath; Z. Ryjáček; I. Schiermeyer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 175 KB 👁 3 views