Sciweavers

45 search results - page 1 / 9
» Hamiltonicity of Topological Grid Graphs
Sort
View
JUCS
2007
120views more  JUCS 2007»
13 years 4 months ago
Hamiltonicity of Topological Grid Graphs
: 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...
Christina Zamfirescu, Tudor Zamfirescu
CCCG
2007
13 years 6 months ago
Hamilton Circuits in Hexagonal Grid Graphs
We look at a variant of the Hamilton circuit problem, where the input is restricted to hexagonal grid graphs. A hexagonal grid graph has a vertex set that is a subset of the grid ...
Kamrul Islam, Henk Meijer, Yurai Núñ...
IPPS
1997
IEEE
13 years 9 months ago
Optimal Scheduling for UET-UCT Generalized n-Dimensional Grid Task Graphs
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
Theodore Andronikos, Nectarios Koziris, George K. ...
SC
2003
ACM
13 years 10 months ago
Synthesizing Realistic Computational Grids
Realistic workloads are essential in evaluating middleware for computational grids. One important component is the raw grid itself: a network topology graph annotated with the har...
Dong Lu, Peter A. Dinda
COMPGEOM
2009
ACM
13 years 11 months ago
On grids in topological graphs
A topological graph is a graph drawn in the plane with vertices represented by points and edges as arcs connecting its vertices. A k-grid in a topological graph is a pair of edge ...
Eyal Ackerman, Jacob Fox, János Pach, Andre...