Planar separators and parallel polygon triangulation
Michael T. Goodrich
J. Computer & Systems Sciences
51:374–389, 1995
Cites:
Separator based sparsification for dynamic planar 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
