4865 search results - page 169 / 973 » The Complexity of Graph Connectivity |
132
Voted
HT
2003
ACM
15 years 8 months ago
2003
ACM
Web sites today serve many different functions, such as corporate sites, search engines, e-stores, and so forth. As sites are created for different purposes, their structure and...
159
Voted
INFOCOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
132
click to vote
JCIT
2008
15 years 3 months ago
2008
Many prominent applications in wireless sensor networks require collected information has to be routed to end nodes in an efficient manner. In general, Connected Dominating Set (C...
118
Voted
COMPGEOM
2009
ACM
15 years 10 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
125
Voted
WDAG
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...