106 search results - page 2 / 22 » Average Case Analysis for Tree Labelling Schemes |
138
click to vote
ICDCN
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The current paper considers the routing problem in dynamic trees under the fixed-port model, in which an adversary chooses the port numbers assigned to each node. We pre...
186
click to vote
ALT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
170
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
We investigate the average-case speed and scalability of parallel algorithms executing on multiprocessors. Our performance metrics are average-speed and isospeed scalability. By m...
150
Voted
IWDC
2005
Springer
15 years 10 months ago
2005
Springer
This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The al...
137
Voted
IPPS
2007
IEEE
15 years 11 months ago
2007
IEEE
This paper deals with the self-stabilizing leader election algorithm of Xu and Srimani [10] that finds a leader in a tree graph. The worst case execution time for this algorithm ...