Testing upward planarity of partial 2-trees

DOI10.1007/978-3-031-22203-0_13arXiv2208.12548OpenAlexW4317393978MaRDI QIDQ6117044

Fabrizio Frati, Chrysanthi N. Raftopoulou, Emilio Di Giacomo, Kirill Simonov, Steven Chaplick, Robert Ganian

Publication date: 16 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.12548

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (3)

Testing upward planarity of partial 2-trees ⋮ Rectilinear Planarity of Partial 2-Trees ⋮ Parameterized approaches to orthogonal compaction

Cites Work

• Unnamed Item
• Unnamed Item
• Upward drawings of triconnected digraphs.
• Orthogonal planarity testing of bounded treewidth graphs
• Planar rectilinear drawings of outerplanar graphs in linear time
• An SPQR-tree-like embedding representation for upward planarity
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Upward Spirality and Upward Planarity Testing
• Spirality and Optimal Orthogonal Drawings
• Optimal Upward Planarity Testing of Single-Source Digraphs
• On-Line Planarity Testing
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time
• Algorithms – ESA 2004
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• Testing upward planarity of partial 2-trees

This page was built for publication: Testing upward planarity of partial 2-trees