On partitioning minimum spanning trees
- 9 August 2024
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 359, 45-54
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Infinity-Norm Rotation TransformsIEEE Transactions on Signal Processing, 2009
- Sparsification—a technique for speeding up dynamic graph algorithmsJournal of the ACM, 1997
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- On the History of the Minimum Spanning Tree ProblemIEEE Annals of the History of Computing, 1985
- A note on bisecting minimum spanning treesNetworks, 1978
- On Finding and Updating Spanning Trees and Shortest PathsSIAM Journal on Computing, 1975