Sciweavers

365 search results - page 3 / 73
» Reconfigurations in Graphs and Grids
Sort
View
DM
2008
86views more  DM 2008»
13 years 6 months ago
Hamiltonian properties of triangular grid graphs
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
Valery S. Gordon, Yury L. Orlovich, Frank Werner
WICSA
2004
13 years 7 months ago
Style-Based Refinement of Dynamic Software Architectures
In this paper, we address the correct refinement of abstract architectural models into more platformspecific representations. We consider the challenging case of dynamic architect...
Luciano Baresi, Reiko Heckel, Sebastian Thöne...
ISCAS
2003
IEEE
116views Hardware» more  ISCAS 2003»
13 years 11 months ago
Using FPGAs to solve the Hamiltonian cycle problem
The Hamiltonian Cycle (HC) problem is an important graph problem with many applications. The general backtracking algorithm normally used for random graphs often takes far too lon...
Micaela Serra, Kenneth B. Kent
GRID
2005
Springer
13 years 11 months ago
Grid'5000: a large scale and highly reconfigurable grid experimental testbed
Franck Cappello, Eddy Caron, Michel J. Daydé...
GD
2007
Springer
14 years 12 days ago
Minimizing the Area for Planar Straight-Line Grid Drawings
Straight-line grid drawings of bounded size is a classical topic in graph drawing. The Graph Drawing Challenge 2006 dealt with minimizing the area of planar straight-line grid draw...
Marcus Krug, Dorothea Wagner