365 search results - page 1 / 73 » Reconfigurations in Graphs and Grids |
SIAMDM
2008
13 years 4 months ago
2008
Let G be a connected graph, and let V and V two n-element subsets of its vertex set V (G). Imagine that we place a chip at each element of V and we want to move them into the posi...
EUROPAR
2004
Springer
13 years 8 months ago
2004
Springer
Abstract This paper proposes an approach to continuously optimizing parallel scientific applications with dynamically changing architectures. We achieve this by combining a dynamic...
JUCS
2007
13 years 4 months ago
2007
: In this paper we study connectivity and hamiltonicity properties of the topological grid graphs, which are a natural type of planar graphs associated with finite subgraphs of th...
CCCG
2006
13 years 6 months ago
2006
We study the Hamiltonian Cycle problem in graphs induced by subsets of the vertices of the tiling of the plane with equilateral triangles. By analogy with grid graphs we call such...
APVIS
2007
13 years 6 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...