Efficient Union-Find for planar graphs and other sparse graph classes

From MaRDI portal
Publication:1274324

DOI10.1016/S0304-3975(97)00291-0zbMath0913.68084MaRDI QIDQ1274324

Jens Gustedt

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)




Related Items (5)



Cites Work


This page was built for publication: Efficient Union-Find for planar graphs and other sparse graph classes