Cart (Loading....) | Create Account
Close category search window
 

A fast algorithm for testing isomorphism of permutation networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sridhar, M.A. ; Dept. of Comput. Sci., South Carolina Univ., Columbia, SC

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(N2) 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

Published in:

Computers, IEEE Transactions on  (Volume:38 ,  Issue: 6 )

Date of Publication:

Jun 1989

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.