Author:
Williamson Matthew,Subramani K.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Mathematics,Control and Optimization
Reference19 articles.
1. Booth, H., Westbrook, J.: A linear algorithm for analysis of minimum spanning and shortest path trees of planar graphs. Algorithmica 11, 341–352 (1992)
2. Borůvka, O.: Borůvka. O jistém problému minimálním. Práce Moravské Pr̆trodovĕdecké Spolec̆nosti v Brnĕ 3, 37–58 (1926)
3. Bright, W.: D Programming Language, 2001. http://www.dlang.org
4. Buchsbaum, A.L., Kaplan, H., Rogers, A., Westbrook, J.R.: Linear-time pointer-machine algorithms for least common ancestors, mst verification, and dominators. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC’98, pp. 279–288. ACM: New York, NY (1998)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)