Miscellaneous topological algorithms.
This paper reviews some algorithms for topological problems, such as the embedding of a 2-complex in 3-space, isomorphism of 2-complexes, etcetera. Some new results are given, including the observation that equivalence of finite 2-complexes is computationally equivalent to graph isomorphism.