1986 search results - page 311 / 398 » Path Separability of Graphs |
CIAC
2000
Springer
14 years 2 days ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
APPROX
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CLUSTER
2002
IEEE
13 years 7 months ago
2002
IEEE
Several distributed routing algorithms for wireless networks were described recently, based on location information of nodes available via Global Positioning System (GPS). In gree...
DATAMINE
2000
13 years 7 months ago
2000
Abstract: Spatial data mining algorithms heavily depend on the efficient processing of neighborhood relations since the neighbors of many objects have to be investigated in a singl...
WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
—In this paper we study the influence of using hub nodes to relay messages in human-based delay tolerant networks (DTNs), by analyzing empirical traces obtained by human mobilit...