Graphs & digraphs (2nd ed.)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Linear time algorithm for isomorphism of planar graphs (Preliminary Report)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Equivalence Between Functionality and Topology of Log N-Stage Banyan Networks
IEEE Transactions on Computers
| Hi-index | 14.98 |
The problem of deciding whether two given permutation sequences are conjugate is addressed. The author exhibits an algorithm that solves this problem in time O(N log N), where N is the sum of the sizes of the two sequences. The algorithm can be applied to the problem of deciding whether two permutation networks are equivalent. The time bound for the algorithm is a significant improvement over the O(N/sup 2/) bound of the algorithm due to Y.A. Oruc and M.Y. Oruc (1985). The author's method applies techniques used by the Hopcroft-Tarjan algorithm for deciding planar graph isomorphism.