1370 search results - page 13 / 274 » On grids in topological graphs |
DM
2010
13 years 8 months ago
2010
A graph G is loosely-c-connected, or -c-connected, if there exists a number d depending on G such that the deletion of fewer than c vertices from G leaves precisely one infinite co...
CCR
2004
13 years 8 months ago
2004
At the inter-domain level, the Internet topology can be represented by a graph with Autonomous Systems (ASes) as nodes and AS peerings as links. This AS-level topology graph has b...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Grid Computing has made substantial advances in the past decade; these are primarily due to the adoption of standardized Grid middleware. However Grid computing has not yet become...
ICN
2009
Springer
13 years 6 months ago
2009
Springer
Grid or 2D Mesh structures are becoming one of the most attractive network topologies to study. They can be used in many different fields raging from future broadband networks to ...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...