✦ LIBER ✦

Efficient coding of labeled directed acyclic graphs

✍ Scribed by B. Steinsky

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Decomposition of structural learning abo

✍ Xianchao Xie; Zhi Geng; Qiang Zhao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 310 KB

Efficient algorithms for acyclic colorin

✍ Zhi-Zhong Chen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Search and sweep numbers of finite direc

✍ Richard J. Nowakowski 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 719 KB

Codings of graphs with binary edge label

✍ Martin Aigner; Eberhard Triesch 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 424 KB

Möbius function for the set of acyclic d

✍ D. K. Arrowsmith; J. W. Essam 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 917 KB

Performance analysis of parallel program

✍ Georg Trogemann; Matthias Gente 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 293 KB