✦ LIBER ✦

On the vector representation of the reachability in planar directed graphs

✍ Scribed by T. Kameda

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the bondage number of planar and dire

✍ Kelli Carlson; Mike Develin 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 185 KB

On random planar graphs, the number of p

✍ Deryk Osthus; Hans Jürgen Prömel; Anusch Taraz 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 219 KB

On the succinct representation of graphs

✍ György Turán 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 371 KB

On the reachability of a version of grap

✍ Kohji Tomita; Haruhisa Kurokawa 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 207 KB

On the time-space complexity of reachabi

✍ Lisa Hellerstein; Philip Klein; Robert Wilber 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 587 KB

On the impossibility of Directed Moore G

✍ W.G Bridges; Sam Toueg 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 136 KB