A fast algorithm for testing isomorphism of permutation networks
From MaRDI portal
Publication:5375484
DOI10.1109/12.24304zbMath1395.68156OpenAlexW2077736748MaRDI QIDQ5375484
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
Analysis of algorithms and problem complexity (68Q25) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Algorithms on strings (68W32)
Related Items (3)
A subquadratic algorithm for the simultaneous conjugacy problem ⋮ Unnamed Item ⋮ The simultaneous conjugacy problem in the symmetric group
This page was built for publication: A fast algorithm for testing isomorphism of permutation networks
