A sequence representation for maps
暂无分享,去创建一个
An easy implementable polynomial algorithm to test for isomorphism of graphs embedded in arbitrary compact surfaces (maps) is given. The map are defined algebraically by Tutte's axtom system. We produce a canonical codification of them as a sequence of 4e integers (2e if the map is orientable) where e is the number of edges. To test for isomorphism between two maps we just have to compare their codes. Some applications relying on the implementation are given.
[1] Robert E. Tarjan,et al. Isomorphism of Planar Graphs , 1972, Complexity of Computer Computations.
[2] H. Whitney. A Set of Topological Invariants for Graphs , 1933 .
[3] L. Weinberg,et al. A Simple and Efficient Algorithm for Determining Isomorphism of Planar Triply Connected Graphs , 1966 .
[4] F. Harary. New directions in the theory of graphs , 1973 .