𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The dag-width of directed graphs

✍ Scribed by Dietmar Berwanger; Anuj Dawar; Paul Hunter; Stephan Kreutzer; Jan Obdržálek

Book ID
116630522
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
346 KB
Volume
102
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Retiming DAGs [direct acyclic graph]
Retiming DAGs [direct acyclic graph]
✍ Calland, P.Y.; Mignotte, A.; Peyran, O.; Robert, Y.; Vivien, F. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 211 KB
The plane-width of graphs
The plane-width of graphs
✍ Marcin Kamiński; Paul Medvedev; Martin Milanič 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 192 KB

Map the vertices of a graph to (not necessarily distinct) points of the plane so that two adjacent vertices are mapped at least unit distance apart. The plane-width of a graph is the minimum diameter of the image of its vertex set over all such mappings. We establish a relation between the plane-wid

Boolean-width of graphs
Boolean-width of graphs
✍ Binh-Minh Bui-Xuan; Jan Arne Telle; Martin Vatshelle 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 449 KB