Upward Planarity Testing

Upward Planarity Testing (1995)

by Ashim Garg , Roberto Tamassia

Venue:	SIAM Journal on Computing
Citations:	74 - 15 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Upward Planarity Testing	user correction - Legacy Corrections
AUTHOR NAME	Ashim Garg	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Brown University	SVM HeaderParse 0.2
AUTHOR ADDR	Providence, RI 02912--1910	SVM HeaderParse 0.1
AUTHOR NAME	Roberto Tamassia	SVM HeaderParse 0.1
AUTHOR AFFIL	Department of Computer Science; Brown University	SVM HeaderParse 0.2
AUTHOR ADDR	Providence, RI 02912--1910	SVM HeaderParse 0.1
ABSTRACT	Acyclic digraphs, such as the covering digraphs of ordered sets, are usually drawn upward, i.e., with the edges monotonically increasing in the vertical direction. A digraph is upward planar if it admits an upward planar drawing. In this survey paper, we overview the literature on the problem of upward planarity testing. We present several characterizations of upward planarity and describe upward planarity testing algorithms for special classes of digraphs, such as embedded digraphs and single-source digraphs. We also sketch the proof of NP-completeness of upward planarity testing.	user correction - Legacy Corrections
YEAR	1995	user correction - Legacy Corrections
VENUE	SIAM Journal on Computing	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	436--441	INFERENCE
VOLUME	25	INFERENCE
CITATIONS	27 found	ParsCit 1.0