✦ LIBER ✦

Embedding planar graphs using PQ-tree algorithms

✍ Scribed by Norishige Chiba; Takao Nishizeki; Shigenobu Abe; Takao Ozawa

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel recognition algorithms for chor

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 193 KB

Graph embedding using tree edit-union

✍ Andrea Torsello; Edwin R. Hancock 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 467 KB

Algorithm visualization using tree graph

✍ Konstantinos Konstantinides 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 709 KB

A note on computing a maximal planar sub

✍ Junger, M.; Leipert, S.; Mutzel, P. 📂 Article 📅 1998 🏛 IEEE 🌐 English ⚖ 185 KB

Constant Approximation Algorithms for Em

✍ V. Chepoi; F. F. Dragan; I. Newman; Y. Rabinovich; Y. Vaxès 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 887 KB

An algorithm for 1-bend embeddings of pl

✍ Aurora Morgana; Célia Picinin de Mello; Giovanna Sontacchi 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 266 KB