scholar.google.com › citations
A branch-and-bound algorithm is given to test whether two such networks are equivalent in polynomial time. Whenever they are, the algorithm also determines a ...
Abstract—A large set of interconnection schemes, collectively referred to as multistage permutation networks, has emerged in the literature as a.
A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2-dimensional partial orders) is described.
A polynomial time algorithm for testing isomorphism of permutation graphs (comparability graphs of 2‐dimensional partial orders) is described.
The author exhibits an algorithm that solves the problem of deciding whether two given permutation sequences are conjugate in time O(N log N), ...
A Fast Algorithm for Testing Isomorphism of Permutation Networks
www.computer.org › journal › 1989/06
The problem of deciding whether two given permutation sequences are conjugate is addressed. The author exhibits an algorithm that solves this problem in ...
Graph isomorphism has been the focus of much recent research [8], both concern- ingitscomplexity [5] and concerning practical algorithms to solve it [22] .
Missing: Networks. | Show results with:Networks.
The problem of deciding whether two given permutation sequences are conjugate is addressed. The author exhibits an algorithm that solves this problem in ...
Feb 11, 2023 · Summary of main contributions: We show the equivalence between testing for graph isomorphism and approximating of permutation-invariant ...
Feb 5, 2021 · Let G and H be two finite non-isomorphic groups in GAP. The GAP command IsomorphismPermGroup. can compute permutation groups isomorphic to G ...
Missing: Testing | Show results with:Testing