365 search results - page 22 / 73 » Reconfigurations in Graphs and Grids |
CCCG
2007
15 years 1 months ago
2007
In this paper, we consider the following graph embedding problem: Given a bipartite graph G = (V1, V2; E), where the maximum degree of vertices in V2 is 4, can G be embedded on a t...
107
click to vote
COMPGEOM
2007
ACM
15 years 3 months ago
2007
ACM
We show how to embed a 3-connected planar graph with n vertices as a 3-polytope with small integer coordinates. The coordinates are bounded by O(27.55n ). The crucial part is the ...
102
click to vote
ISI
2007
Springer
14 years 11 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
HICSS
2010
IEEE
15 years 6 months ago
2010
IEEE
Numerous recent papers have found important relationships between network structure and risks within networks. These results indicate that network structure can dramatically affec...
SOFSEM
2005
Springer
15 years 5 months ago
2005
Springer
d Abstract) Lubomir Torok Institute of Mathematics and Computer Science Slovak Academy of Sciences Severna 5, 974 01 Banska Bystrica, Slovak Republic 3-dimensional layout of graph...