Maximum upward planar subgraphs of embedded planar digraphs

DOI10.1016/J.COMGEO.2008.02.001MaRDI QIDQ945947zbMATH OpenOpenAlexFDO

Authors Carla Binucci, Walter Didimo, Francesco Giordano

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

algorithmscomplexitygraph drawingexperimental studyupward planarity

Mathematics Subject Classification ID

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

Recommendations

• Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
• Computing maximum upward planar subgraphs of single-source embedded digraphs
• Maximum upward planar subgraph of a single-source embedded digraph
• Graph Drawing
• Upward planarity testing

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A note on minimum-area upward drawing of complete and Fibonacci trees
• A note on optimal area algorithms for upward drawings of binary trees
• Algorithms for plane representations of acyclic digraphs
• Algorithms – ESA 2004
• An Approach for Mixed Upward Planarization
• An experimental comparison of four graph drawing algorithms.
• Area requirement and symmetry display of planar upward drawings
• Area-efficient algorithms for straight-line tree drawings
• Drawing graphs. Methods and models
• Fundamentals of planar ordered sets
• Graph Drawing
• Linear area upward drawings of AVL trees
• On the computational complexity of upward and rectilinear planarity testing
• Optimal Upward Planarity Testing of Single-Source Digraphs
• PLANAR UPWARD TREE DRAWINGS WITH OPTIMAL AREA
• Planar Formulae and Their Uses
• Planar Lattices
• Planar lattices and planar graphs
• Quasi-upward planarity
• TWO FIXED-PARAMETER TRACTABLE ALGORITHMS FOR TESTING UPWARD PLANARITY
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Upward Planar Drawings and Switch-regularity Heuristics
• Upward drawings of triconnected digraphs.
• Upward planarity testing

Cited in

(13)

• Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
• Computing k-modal embeddings of planar digraphs
• Maximum upward planar subgraph of a single-source embedded digraph
• On the number of upward planar orientations of maximal planar graphs
• Intrinsic linking in directed graphs
• Parameterized and approximation algorithms for the maximum bimodal subgraph problem
• 1-bend upward planar slope number of SP-digraphs
• Computing maximum upward planar subgraphs of single-source embedded digraphs
• Upward and quasi-upward planarity testing of embedded mixed graphs
• Upward planar graphs and their duals
• 1-bend upward planar drawings of SP-digraphs
• Upward planarity testing of embedded mixed graphs
• scientific article; zbMATH DE number 1830747 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945947)