1. , and , The Design and Analysis of Computer Algorithms, Addison Wesley, Reading, MA, 1974.
2. , and , “The K Shortest Spanning Trees of a Graph,” Int. Rep. 73–10, IEE-LCE, Politecnico di Milano, 1973.
3. , and , “Efficient Methods for Ranking Trees,” Proceedings of the 3rd International Symposium on Network Theory, Split, Yugoslavia, Sept. 1975, pp. 419–429.
4. A note on finding optimum branchings
5. Finding Minimum Spanning Trees