Publication Date



The AppleTalk system is shown to be a viable environment for experimentation in distributed processing. Two illustrative educational examples of distributed algorithms are presented and discussed. The first example is the deterministic equivalent ofthe wellknown non deterministic algorithm for sub graph isomorphism. The second example introduces parallelism by subdividing the travelling salesman problem into sub problems and constructing an approximate solution by combining exact solutions of the sub problems. Issues of computational complexity and efficient usage ofthe network are discussed.