4865 search results - page 469 / 973 » The Complexity of Graph Connectivity |
194
click to vote
NETWORKING
2007
15 years 8 months ago
2007
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
177
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
This paper presents a coordination algorithm for mobile autonomous robots. Relying upon distributed sensing, the robots achieve rendezvous, that is, they move to a common location....
241
click to vote
JCP
2008
15 years 7 months ago
2008
We perform the task of shape recognition using a skeleton based method. Skeleton of the shape is considered as a free tree and is represented by a connectivity graph. Geometric fea...
188
click to vote
DCG
2007
15 years 7 months ago
2007
Steinitz’s Theorem states that a graph is the 1-skeleton of a convex polyhedron if and only if it is 3-connected and planar. The polyhedron is called a geometric realization of ...
164
click to vote
IPL
2007
15 years 6 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...