Maximum Upward Planar Subgraphs of Embedded Planar Digraphs

DOI10.1007/978-3-540-77537-9_20zbMath1137.68469OpenAlexW1672986066MaRDI QIDQ5452223

Walter Didimo, Carla Binucci, 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

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 algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (1)

Computing maximum upward planar subgraphs of single-source embedded digraphs

This page was built for publication: Maximum Upward Planar Subgraphs of Embedded Planar Digraphs