Maximum upward planar subgraph of a single-source embedded digraph

DOI10.1007/978-3-642-14031-0_14MaRDI QIDQ3578308zbMATH OpenOpenAlexFDO

Authors Aimal Rextin, Patrick Healy

Publication date 20 July 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14031-0_14

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Computing maximum upward planar subgraphs of single-source embedded digraphs
• Maximum upward planar subgraphs of embedded planar digraphs
• Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• scientific article; zbMATH DE number 432821

Cited in

(6)

• Computing maximum upward planar subgraphs of single-source embedded digraphs
• scientific article; zbMATH DE number 432821 (Why is no real title available?)
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
• Maximum upward planar subgraphs of embedded planar digraphs

This page was built for publication: Maximum upward planar subgraph of a single-source embedded digraph

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