Sciweavers

1370 search results - page 7 / 274
» On grids in topological graphs
Sort
View
DM
2008
86views more  DM 2008»
13 years 7 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
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
ICIAP
2007
ACM
14 years 7 months ago
Topology Preserving Marching Cubes-like Algorithms on the Face-Centered Cubic Grid
The well-known marching cubes algorithm is modified to apply to the face-centered cubic (fcc) grid. Thus, the local configurations that are considered when extracting the local su...
Robin Strand, Peer Stelldinger
MOBIHOC
2008
ACM
14 years 7 months ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker
GD
2007
Springer
14 years 1 months 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