Quasi-upward planarity

DOI10.1007/s00453-001-0083-xzbMath1009.68186OpenAlexW1985050272MaRDI QIDQ1348947

Giuseppe Di Battista, Walter Didimo, Paola Bertolazzi

Publication date: 21 May 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0083-x

zbMATH Keywords

digraphdirected graphquasi-upward planarity

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (17)

SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS ⋮ Quasi-upward planar drawings with minimum curve complexity ⋮ Upward planar drawings on the standing and the rolling cylinders ⋮ Upward book embeddability of \(st\)-graphs: complexity and algorithms ⋮ Planar Confluent Orthogonal Drawings of 4-Modal Digraphs ⋮ Planar confluent orthogonal drawings of 4-modal digraphs ⋮ Upward and quasi-upward planarity testing of embedded mixed graphs ⋮ Extending upward planar graph drawings ⋮ Maximum upward planar subgraphs of embedded planar digraphs ⋮ Unnamed Item ⋮ Improving the running time of embedded upward planarity testing ⋮ An Improved Upward Planarity Testing Algorithm and Related Applications ⋮ A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs ⋮ Upward planar graphs and their duals ⋮ Upward Book Embeddings of st-Graphs ⋮ Upward Planarity Testing in Practice ⋮ TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY

This page was built for publication: Quasi-upward planarity