✦ LIBER ✦

On the complexity of exact algorithm for L (2, 1)-labeling of graphs

✍ Scribed by Konstanty Junosza-Szaniawski; Paweł Rzążewski

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

✍ Frédéric Havet; Martin Klazar; Jan Kratochvíl; Dieter Kratsch; Mathieu Liedloff 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 850 KB

On the Complexity of Canonical Labeling

✍ Babai, László 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 505 KB

On L(d,1)-labelings of graphs

✍ Gerard J. Chang; Wen-Tsai Ke; David Kuo; Daphne D.-F. Liu; Roger K. Yeh 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 116 KB

On the Structure of Graphs with Non-Surj

✍ Georges, John P.; Mauro, David W. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 232 KB

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

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

A note on the complexity of Dijkstra's a

✍ Barbehenn, M. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 66 KB