Maximum upward planar subgraphs of embedded planar digraphs

Authors:
Carla Binucci;Walter Didimo;Francesco Giordano
Affiliations:
DIEI, Università degli Studi di Perugia;DIEI, Università degli Studi di Perugia;DIEI, Università degli Studi di Perugia
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 6
Cited 1

Optimal Upward Planarity Testing of Single-Source Digraphs

SIAM Journal on Computing
An experimental comparison of four graph drawing algorithms

Computational Geometry: Theory and Applications
Upward Planar Drawing of Single-Source AcyclicDigraphs

SIAM Journal on Computing
On the Computational Complexity of Upward and Rectilinear Planarity Testing

SIAM Journal on Computing
Upward Planarity Testing of Outerplanar Dags

GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Upward spirality and upward planarity testing

GD'05 Proceedings of the 13th international conference on Graph Drawing

Maximum upward planar subgraph of a single-source embedded digraph

COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an extensive study on the problem of computing maximum upward planar subgraphs of embedded planar digraphs: Complexity results, algorithms, and experiments are presented. Namely: (i) We prove that the addressed problem is NP-Hard; (ii) A fast heuristic and an exponential-time exact algorithm are described; (iii) A wide experimental analysis is performed to show the effectiveness of our techniques.