A minimum spanning tree algorithm with inverse-ackermann type complexity

Research output: Contribution to journalArticlepeer-review

192 Scopus citations

Fingerprint Dive into the research topics of 'A minimum spanning tree algorithm with inverse-ackermann type complexity'. Together they form a unique fingerprint.

Engineering & Materials Science