Separator based sparsification. I: Planarity testing and minimum spanning trees
From MaRDI portal
Publication:1915501
DOI10.1006/jcss.1996.0002zbMath0846.68079WikidataQ61609645 ScholiaQ61609645MaRDI QIDQ1915501
Giuseppe F. Italiano, David Eppstein, Thomas H. Spencer, Zvi Galil
Publication date: 16 July 1996
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.1996.0002
Related Items
Maintaining dynamic minimum spanning trees: an experimental study, Decomposable multi-parameter matroid optimization problems., Incremental convex planarity testing