552 search results - page 32 / 111 » Lower bounds for dynamic connectivity |
COCO
2009
Springer
14 years 4 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
SIROCCO
2007
13 years 11 months ago
2007
Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consulting the labels given to any t...
CJ
2010
13 years 9 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...
PIMRC
2008
IEEE
14 years 4 months ago
2008
IEEE
—Wireless mesh networks (WMNs) is a promising key technology for next generation wireless backhauling that have recently attracted both the academic and industrial interest. Such...
JNW
2007
13 years 9 months ago
2007
— This paper presented a fully distributed algorithm to compute a planar subgraph of the underlying wireless connectivity graph. This work considered the idealized unit disk grap...