Maximum upward planar subgraphs of embedded planar digraphs
type: Item
instance of: scholarly article
title: Maximum upward planar subgraphs of embedded planar digraphs
zbMATH Open document ID: 1152.05319
author: Carla Binucci
author: Walter Didimo
author: Francesco Giordano
published in: Computational Geometry
publication date: 2008-09-19T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 5345385
zbMATH Keywords: graph drawing
zbMATH Keywords: upward planarity
zbMATH Keywords: complexity
zbMATH Keywords: algorithms
zbMATH Keywords: experimental study
MaRDI profile type: Publication
full work available at URL: j.comgeo.2008.02.001
OpenAlex ID: W2090327654
cites work: Quasi-upward planarity
cites work: Upward drawings of triconnected digraphs.
cites work: Optimal Upward Planarity Testing of Single-Source Digraphs
cites work: Algorithms – ESA 2004
cites work: A note on optimal area algorithms for upward drawings of binary trees
cites work: Linear area upward drawings of AVL trees
cites work: Q3154375
cites work: An experimental comparison of four graph drawing algorithms.
cites work: Algorithms for plane representations of acyclic digraphs
cites work: Area requirement and symmetry display of planar upward drawings
cites work: Upward Planar Drawings and Switch-regularity Heuristics
cites work: Graph Drawing
cites work: An Approach for Mixed Upward Planarization
cites work: Q4198056
cites work: PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
cites work: Upward planarity testing
cites work: On the computational complexity of upward and rectilinear planarity testing
cites work: TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
cites work: Upward Planar Drawing of Single-Source Acyclic Digraphs
cites work: Drawing graphs. Methods and models
cites work: Fundamentals of planar ordered sets
cites work: Planar Lattices
cites work: Planar Formulae and Their Uses
cites work: Planar lattices and planar graphs
cites work: Area-efficient algorithms for straight-line tree drawings
cites work: A note on minimum-area upward drawing of complete and Fibonacci trees
DOI: 10.1016/J.COMGEO.2008.02.001
description: scientific article; zbMATH DE number 5345385