Logo image
Sign in
Back
Using graphs for the analysis and construction of permutation distance-preserving mappings
Journal article   Open access

Using graphs for the analysis and construction of permutation distance-preserving mappings

Theo G. Swart, Hendrik C. Ferreira and Khmaies Ouahada
2008
Handle:
https://hdl.handle.net/10210/20030

Abstract

Code construction Distance-preserving mappings Representation of graphs Permutations Mappings (Mathematics)
Abstract: A new way of looking at permutation distance-preserving mappings (DPMs) is presented by making use of a graph representation. The properties necessary to make such a graph distance-preserving, are also investigated. Further, this new knowledge is used to analyze previous constructions, as well as to construct a new general mapping algorithm for a previous multilevel construction.
pdf
Using graphs for the analysis and construction of permutation distance-preserving mappingsDownloadView
Open Access

Metrics

2 File views/ downloads
11 Record Views

Details