Programming with sets; an introduction to SETL
Programming with sets; an introduction to SETL
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Algorithms
An inverted taxonomy of sorting algorithms
Communications of the ACM - Special section on computer architecture
Program Transformation Systems
ACM Computing Surveys (CSUR)
The Science of Programming
Computer Communications Network Design and Analysis
Computer Communications Network Design and Analysis
A Discipline of Programming
Data Structures and Algorithms
Data Structures and Algorithms
Introduction to the Design and Analysis of Algorithms
Introduction to the Design and Analysis of Algorithms
The role of the high level specification in programming by transformation: specification and transformation by parts
Extensions to setl to support problem specification and transformation of imperative programs
Extensions to setl to support problem specification and transformation of imperative programs
A case for OO -- Java -- in teaching algorithm analysis
PPPJ '03 Proceedings of the 2nd international conference on Principles and practice of programming in Java
Object-oriented algorithm analysis and design with Java
Science of Computer Programming - Special issue on principles and practice of programming in java (PPPJ 2003)
| Hi-index | 0.00 |
The problem of the design of communications networks has spawned the development of many of the algorithms currently used to solve the minimum cost spanning tree problem. We show that three minimum cost spanning tree algorithms, those by Kruskal, Prim, and Esau and Williams, can be derived from a single problem specification using “specification and transformation by parts,” a methodology for deriving families of algorithms. This approach is an alternative to the Kershenbaum and Chou unification of spanning tree algorithms. Whereas the Kershenbaum & Chou approach might be called bottom up, this is a top down approach which shows the original unity of the algorithms which emerges from the statement of the problem and also the essential differences. Besides pedagogical and aesthetic value, we maintain that an understanding of the algorithms from this perspective may be helpful in network design and modification.