Maximum Upward Planar Subgraphs of Embedded Planar Digraphs

DOI10.1007/978-3-540-77537-9_20MaRDI QIDQ5452223zbMATHOpenAlexFDO

Authors Carla Binucci, Walter Didimo, Francesco Giordano

Publication date 25 March 2008

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77537-9_20

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

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

Cited in

(6)

• Computing maximum upward planar subgraphs of single-source embedded digraphs
• On the number of upward planar orientations of maximal planar graphs
• Upward planar graphs and their duals
• Maximum upward planar subgraphs of embedded planar digraphs
• SOFSEM 2005: Theory and Practice of Computer Science
• Maximum upward planar subgraph of a single-source embedded digraph

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 Q5452223)