✦ LIBER ✦

The complexity of planarity testing

✍ Scribed by Eric Allender; Meena Mahajan

Book ID: 113641488
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 321 KB
Volume: 189
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2003.09.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Computational Complexity of Upwar

On the Computational Complexity of Upward and Rectilinear Planarity Testing

✍ Garg, Ashim; Tamassia, Roberto 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 400 KB

Hypergraph planarity and the complexity

Hypergraph planarity and the complexity of drawing venn diagrams

✍ D. S. Johnson; H. O. Pollak 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 821 KB

We introduce two new notions of planarity for hypergraphs based on dual generalizations of the standard Venn diagram. These definitions are illustrated by results concerning the existence and nonexistence of such diagrams for certain classes of hypergraphs. We conclude by showing that the general pr

Testing Planarity of Geometric Automorph

Testing Planarity of Geometric Automorphisms in

✍ Christoph Buchheim; Seok-Hee Hong 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 584 KB

Planarity testing of doubly periodic inf

Planarity testing of doubly periodic infinite graphs

✍ Kazuo Iwano; Kenneth Steiglitz 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 773 KB

Improving the running time of embedded u

Improving the running time of embedded upward planarity testing

✍ Sarmad Abbasi; Patrick Healy; Aimal Rextin 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 209 KB

Optimal Upward Planarity Testing of Sing

Optimal Upward Planarity Testing of Single-Source Digraphs

✍ Bertolazzi, Paola; Di Battista, Giuseppe; Mannino, Carlo; Tamassia, Roberto 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 698 KB