Quasi-upward planarity
From MaRDI portal
Publication:1348947
DOI10.1007/S00453-001-0083-XzbMATH Open1009.68186OpenAlexW1985050272MaRDI QIDQ1348947FDOQ1348947
Authors: Giuseppe Di Battista, P. Bertolazzi, Walter Didimo 
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
Recommendations
Cited In (21)
- Title not available (Why is that?)
- Upward Book Embeddings of st-Graphs
- Improving the running time of embedded upward planarity testing
- Planar Confluent Orthogonal Drawings of 4-Modal Digraphs
- Planar confluent orthogonal drawings of 4-modal digraphs
- Upward planar morphs
- A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
- Title not available (Why is that?)
- SOFSEM 2005: Theory and Practice of Computer Science
- Upward book embeddability of \(st\)-graphs: complexity and algorithms
- Parameterized and approximation algorithms for the maximum bimodal subgraph problem
- Quasi-upward planar drawings with minimum curve complexity
- Maximum upward planar subgraphs of embedded planar digraphs
- Upward and quasi-upward planarity testing of embedded mixed graphs
- Extending upward planar graph drawings
- Upward planarity testing in practice: SAT formulations and comparative study
- Upward planar graphs and their duals
- SIMULTANEOUS EMBEDDING OF EMBEDDED PLANAR GRAPHS
- TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
- An Improved Upward Planarity Testing Algorithm and Related Applications
- Upward planar drawings on the standing and the rolling cylinders
This page was built for publication: Quasi-upward planarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1348947)
