Alpha-algorithms for incremental planarity testing
Johannes A. La Poutré
Proc. 26th Symp. Theory of Computing
,
ACM
,
May 1994, pp. 706–715
Cites:
Maintenance of a minimum spanning forest in a dynamic planar graph
Separator based sparsification for dynamic planar graph algorithms
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
