Maximum upward planar subgraphs of embedded planar digraphs

DOI10.1016/j.comgeo.2008.02.001zbMath1152.05319OpenAlexW2090327654MaRDI QIDQ945947

Walter Didimo, Francesco Giordano, Carla Binucci

Publication date: 19 September 2008

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.02.001

zbMATH Keywords

complexityalgorithmsgraph drawingexperimental studyupward planarity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20)

Related Items (7)

Computing maximum upward planar subgraphs of single-source embedded digraphs ⋮ Intrinsic linking in directed graphs ⋮ Upward Planarity Testing of Embedded Mixed Graphs ⋮ 1-Bend Upward Planar Drawings of SP-Digraphs ⋮ 1-bend upward planar slope number of SP-digraphs ⋮ Upward and quasi-upward planarity testing of embedded mixed graphs ⋮ Computing k-modal embeddings of planar digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Upward drawings of triconnected digraphs.
• A note on minimum-area upward drawing of complete and Fibonacci trees
• Fundamentals of planar ordered sets
• Algorithms for plane representations of acyclic digraphs
• Area requirement and symmetry display of planar upward drawings
• A note on optimal area algorithms for upward drawings of binary trees
• Planar lattices and planar graphs
• Quasi-upward planarity
• Linear area upward drawings of AVL trees
• Upward planarity testing
• Area-efficient algorithms for straight-line tree drawings
• An experimental comparison of four graph drawing algorithms.
• On the Computational Complexity of Upward and Rectilinear Planarity Testing
• Planar Formulae and Their Uses
• Planar Lattices
• Optimal Upward Planarity Testing of Single-Source Digraphs
• An Approach for Mixed Upward Planarization
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Upward Planar Drawings and Switch-regularity Heuristics
• Algorithms – ESA 2004
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
• Graph Drawing
• Drawing graphs. Methods and models

This page was built for publication: Maximum upward planar subgraphs of embedded planar digraphs