4865 search results - page 316 / 973 » The Complexity of Graph Connectivity |
148
click to vote
SIAMDM
2010
15 years 1 months ago
2010
The routing number rt(G) of a connected graph G is the minimum integer r so that every permutation of vertices can be routed in r steps by swapping the ends of disjoint edges. In t...
172
click to vote
INFOCOM
2007
IEEE
16 years 1 months ago
2007
IEEE
— Wireless routing based on an embedding of the connectivity graph is a very promising technique to overcome shortcomings of geographic routing and topology-based routing. This i...
180
click to vote
ICALP
2007
Springer
16 years 26 days ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
188
click to vote
ICRA
2005
IEEE
16 years 9 days ago
2005
IEEE
— We consider the problem of inferring sensor positions and a topological (i.e. qualitative) map of an environment given a set of cameras with non-overlapping fields of view. In...
176
click to vote
PODC
1990
ACM
15 years 10 months ago
1990
ACM
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...