Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

Harold N. Gabow, Zvi Galil, Thomas Spencer, Robert Endre Tarjan

Research output: Contribution to journalArticlepeer-review

349 Scopus citations

Fingerprint

Dive into the research topics of 'Efficient algorithms for finding minimum spanning trees in undirected and directed graphs'. Together they form a unique fingerprint.

Mathematics