✦ LIBER ✦

Exact Algorithms forL(2,1)-Labeling of Graphs

✍ Scribed by Frédéric Havet; Martin Klazar; Jan Kratochvíl; Dieter Kratsch; Mathieu Liedloff

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of exact algorithm for

✍ Konstanty Junosza-Szaniawski; Paweł Rzążewski 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 160 KB

OnL(2,1)-labeling of generalized Peterse

✍ Yuan-Zhen Huang, Chun-Ying Chiang, Liang-Hao Huang, Hong-Gwa Yeh 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 639 KB

The (2,1) -Total Labeling of Double Grap

✍ Qiaoling Ma; Jihui Wang 📂 Article 📅 2011 🏛 Elsevier ⚖ 422 KB

$L(2,1)$-Labeling of Hamiltonian graphs

✍ Kang, Jeong-Hyun 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 246 KB

L(h, 1, 1)-labeling of outerplanar graph

✍ Tiziana Calamoneri; Emanuele G. Fusco; Richard B. Tan; Paola Vocca 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 684 KB

Improved Self-Stabilizing Algorithms for

✍ Pranay Chaudhuri; Hussein Thompson 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 316 KB