Add to ORKGWe prove that the dilation of an $m \times n$ toroidal mesh in an $mn$-vertex path equals $2\min\{m,n\}$, if $m\not= n$ and $2n-1$, if $m=n$
AbstractLet G be a graph with n vertices which is embedded in Euclidean space Rd. For any two vertic...
The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph...
Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the l...
We give a short proof that the dilation of an m X n toroidal mesh in an mn-vertex path equals 2 min(...
We prove that the dilation of an $m \times n$ toroidal mesh in an $mn$-vertex path equals $2\min\{m,...
We prove several exact results for the dilation of well-known interconnection networks in cycles, na...
The {\em dynamic planar point location problem} is the task of maintaining a dynamic set $S$ of $n$ ...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by r...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
AbstractLet G be a graph with n vertices which is embedded in Euclidean space Rd. For any two vertic...
The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph...
Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the l...
We give a short proof that the dilation of an m X n toroidal mesh in an mn-vertex path equals 2 min(...
We prove that the dilation of an $m \times n$ toroidal mesh in an $mn$-vertex path equals $2\min\{m,...
We prove several exact results for the dilation of well-known interconnection networks in cycles, na...
The {\em dynamic planar point location problem} is the task of maintaining a dynamic set $S$ of $n$ ...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
A mesh of buses (MOB), a versatile parallel architecture, is obtained from a 2-dimensional mesh by r...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
AbstractWe prove exact results on dilations in cycles for important parallel computer interconnectio...
Two embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorphism of Σ...
Consider a geometric network G in the plane. The dilation between any two vertices x and y in G is t...
Let G be a graph with n vertices which is embedded in Euclidean space R d. For any two vertices of G...
AbstractTwo embeddings Ψ1 and Ψ2 of a graph G in a surface Σ are equivalent if there is a homeomorph...
AbstractLet G be a graph with n vertices which is embedded in Euclidean space Rd. For any two vertic...
The skewness sk(G) of a graph G = (V, E) is the smallest integer sk(G) >= 0 such that a planar graph...
Let G be a graph embedded in Euclidean space. For any two vertices of G their dilation denotes the l...