1370 search results - page 123 / 274 » On grids in topological graphs |
181
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We consider a product X of n finite intervals of integers, a map F from X to itself, the asynchronous state transition graph (F) on X that Thomas proposed as a model for the dynam...
266
click to vote
DCG
2011
14 years 10 months ago
2011
We describe a variant of a method used by modern graphic artists to design what are traditionally called Celtic knots, which are part of a larger family of designs called “mirro...
138
click to vote
GD
2007
Springer
16 years 17 days ago
2007
Springer
Let G = (V, E) be a graph with n vertices and m ≥ 4n edges drawn in the plane. The celebrated Crossing Lemma states that G has at least Ω(m3 /n2 ) pairs of crossing edges; or ...
168
click to vote
CCGRID
2006
IEEE
16 years 14 days ago
2006
IEEE
Making effective use of computational Grids requires scheduling Grid applications onto resources that best match them. Resource-related state (e.g., load, availability, and locati...
172
click to vote
CCGRID
2003
IEEE
15 years 11 months ago
2003
IEEE
— Since the advent of distributed computer systems an active field of research has been the investigation of scheduling strategies for parallel applications. The common approach...