✦ LIBER ✦

Retiming DAGs [direct acyclic graph]

✍ Scribed by Calland, P.Y.; Mignotte, A.; Peyran, O.; Robert, Y.; Vivien, F.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The dag-width of directed graphs

✍ Dietmar Berwanger; Anuj Dawar; Paul Hunter; Stephan Kreutzer; Jan Obdržálek 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 346 KB

Collapsibility for Directed Acyclic Grap

✍ XIANCHAO XIE; ZHI GENG 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 738 KB

Hierarchical directed acyclic graph kern

✍ Jun Suzuki; Yutaka Sasaki; Eisaku Maeda 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 607 KB

DAG—a program that draws directed graphs

✍ E. R. Gansner; S. C. North; K. P. Vo 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB

Heuristic chaining in directed acyclic g

✍ R. Venugopal; Y.N. Srikant 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 897 KB

Random Generation of Directed Acyclic Gr

✍ G. Melançon; I. Dutour; M. Bousquet-Mélou 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 301 KB