On-line planar graph embedding
Roberto Tamassia
J. Algorithms
21(2):201–239, Sep 1996
Cites:
Separator based sparsification for dynamic planar graph algorithms
Sparsification — A technique for speeding up dynamic graph algorithms
Maintenance of a minimum spanning forest in a dynamic planar graph
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
