Add to ORKGAbstract A new way of analyzing permutation distance preserving mappings is presented by making use of a graph representation. The properties necessary to make such graphs distance-preserving and how this relates to the total sum of distances that exist for such mappings, are investigated. This new knowledge is used to analyze previous constructions, as well as showing the existence or non-existence of simple algorithms for mappings attaining the upper bound on the sum of distances. Finally, two applications for such graphs are considered
It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
Abstract: A new way of looking at permutation distance-preserving mappings (DPMs) is presented by ma...
Abstract A new way of analyzing permutation distance preserving mappings is presented by making use ...
In this thesis, we study a branch of mathematics known as graph theory. We begin by explaining the p...
Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary...
D.Ing.In this thesis we combined two techniques, namely a spectral shaping technique and a distance-...
The class of permutation graphs has been studied extensively for more than two decades. The most pop...
Abstract—Mappings of the set of binary vectors of a fixed length to the set of permutations of the s...
AbstractA permutation graph Gπ of a graph G (or generalized prism) is obtained by taking two disjoin...
If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of...
The problem of sorting by transpositions asks for a sequence of adjacent interval exchanges that sor...
We present a question, motivated from chemical graph theory, of maximizing the sum of pairwise dista...
AbstractA graph X is said to be distance-balanced if for any edge uv of X, the number of vertices cl...
It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
Abstract: A new way of looking at permutation distance-preserving mappings (DPMs) is presented by ma...
Abstract A new way of analyzing permutation distance preserving mappings is presented by making use ...
In this thesis, we study a branch of mathematics known as graph theory. We begin by explaining the p...
Abstract: A multilevel construction is introduced to create distance-preserving mappings from binary...
D.Ing.In this thesis we combined two techniques, namely a spectral shaping technique and a distance-...
The class of permutation graphs has been studied extensively for more than two decades. The most pop...
Abstract—Mappings of the set of binary vectors of a fixed length to the set of permutations of the s...
AbstractA permutation graph Gπ of a graph G (or generalized prism) is obtained by taking two disjoin...
If the genetic maps of two species are modelled as permutations of (homologous) genes, the number of...
The problem of sorting by transpositions asks for a sequence of adjacent interval exchanges that sor...
We present a question, motivated from chemical graph theory, of maximizing the sum of pairwise dista...
AbstractA graph X is said to be distance-balanced if for any edge uv of X, the number of vertices cl...
It is the very usual case that the sbortest paths between all pairs of vertices in a given graph are...
AbstractA distance-transitive graph is a graph in which for every two ordered pairs of vertices (u,v...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...