A fast algorithm for testing isomorphism of permutation networks

DOI10.1109/12.24304MaRDI QIDQ5375484zbMATH OpenOpenAlexFDO

Authors M. A. Sridhar

Publication date 14 September 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/12.24304

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Algorithms on strings (68W32)

Cited in

(3)

• The simultaneous conjugacy problem in the symmetric group
• A subquadratic algorithm for the simultaneous conjugacy problem
• scientific article; zbMATH DE number 7746253 (Why is no real title available?)

This page was built for publication: A fast algorithm for testing isomorphism of permutation networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5375484)