Building blocks of upward planar digraphs

Authors:
Patrick Healy;Karol Lynch
Affiliations:
CSIS Department, University of Limerick, Limerick, Ireland;CSIS Department, University of Limerick, Limerick, Ireland
Venue:
GD'04 Proceedings of the 12th international conference on Graph Drawing
Year:
2004

Citing 1
Cited 2

Graph Drawing: Algorithms for the Visualization of Graphs

Graph Drawing: Algorithms for the Visualization of Graphs

Upward spirality and upward planarity testing

GD'05 Proceedings of the 13th international conference on Graph Drawing
Fixed-Parameter tractable algorithms for testing upward planarity

SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a digraph is upward planar if and only if its biconnected components have certain properties.