613 search results - page 94 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
137
Voted
CORR
2011
Springer
14 years 10 months ago
2011
Springer
An acyclic coloring of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of star ...
164
Voted
GC
2008
Springer
15 years 3 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
126
Voted
ESA
1999
Springer
15 years 8 months ago
1999
Springer
This paper deals with the on-line allocation of shared data objects to the local memory modules of the nodes in a network. We assume that the data is organized in indivisible objec...
136
Voted
ADBIS
1995
Springer
15 years 7 months ago
1995
Springer
One of the most important operations in spatial access needed systems are spatial joins. Using for processing such operations R-tree like structures is intensively studies now. Th...
130
click to vote
ICC
2007
IEEE
15 years 10 months ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...