On the sizes of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks (extended abstract) (1995).

Content Provider	CiteSeerX
Author	Hromkovic, J. Lorys, K. Kanarek, P. Klasing, R. Unger, W. Wagener, H.
Abstract	The sizes of permutation networks for special sets of permutations (like all shifts or shifts of power two) are investigated in vertex-disjoint path mode as well as in edge-disjoint path model. The study of the planar realization and the search for small but hard sets of permutations are also included. Several asymptotically optimal estimations for distinct subsets of t...
File Format	PDF
Publisher Date	1995-01-01
Access Restriction	Open
Subject Keyword	Permutation Network Extended Abstract Hypercube Algorithm Bounded-degree Network Efficient Simulation Special Set Planar Realization Distinct Subset Edge-disjoint Path Model Hard Set Vertex-disjoint Path Mode Optimal Estimation
Content Type	Text