Computing maximum upward planar subgraphs of single-source embedded digraphs

DOI10.1007/S10878-010-9373-ZMaRDI QIDQ2377381zbMATH OpenOpenAlexFDO

Authors Aimal Rextin, Patrick Healy

Publication date 28 June 2013

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-010-9373-z

zbMATH Keywords

graph drawingsingle-source digraphsupward planarity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Maximum upward planar subgraph of a single-source embedded digraph
• 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

Cites work

• scientific article; zbMATH DE number 2123123 (Why is no real title available?)
• Improving the running time of embedded upward planarity testing
• Maximum Upward Planar Subgraphs of Embedded Planar Digraphs
• Maximum upward planar subgraphs of embedded planar digraphs
• On the computational complexity of upward and rectilinear planarity testing
• Optimal Upward Planarity Testing of Single-Source Digraphs
• Upward drawings of triconnected digraphs.
• Upward Planar Drawing of Single-Source Acyclic Digraphs
• Upward Planar Drawings and Switch-regularity Heuristics
• Upward spirality and upward planarity testing

Cited in

(7)

• scientific article; zbMATH DE number 432821 (Why is no real title available?)
• Maximum upward planar subgraph of a single-source embedded digraph
• A Fully Dynamic Algorithm to Test the Upward Planarity of Single-Source Embedded Digraphs
• 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: Computing maximum upward planar subgraphs of single-source embedded digraphs

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