11381 search results - page 46 / 2277 » Connectivity |
ICCS
2007
Springer
15 years 4 months ago
2007
Springer
1 A graph G is hamiltonian-connected if any two of its vertices are connected by a Hamilton2 path (a path including every vertex of G); and G is s-hamiltonian-connected if the del...
114
Voted
OPODIS
2003
15 years 1 months ago
2003
One of the problems of middleware for shared state is that they are designed, explicitly or implicitly, for symmetric networks. However, since the Internet is not symmetric, end-to...
AUTOMATICA
2010
15 years 18 days ago
2010
The ability of a robot team to reconfigure itself is useful in many applications: for metamorphic robots to change shape, for swarm motion towards a goal, for biological systems to...
99
Voted
COMGEO
2008
ACM
15 years 17 days ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
72
Voted
DM
2010
15 years 16 days ago
2010
Let G be a connected graph, suppose that v is a vertex of G, and denote the subgraph formed from G by deleting vertex v by G \ v. Denote the algebraic connectivities of G and G \ ...