Sciweavers

2354 search results - page 120 / 471
» Radio number for trees
Sort
View
TCS
2008
15 years 6 months ago
The 2-radius and 2-radiian problems on trees
In this paper, we consider two facility location problems on tree networks. One is the 2-radius problem, whose goal is to partition the vertex set of the given network into two no...
Hung-Lung Wang, Kun-Mao Chao
ORDER
2002
74views more  ORDER 2002»
15 years 6 months ago
Lines, Trees, and Branch Spaces
: In this paper we examine the interactions between the topology of certain linearly ordered topological spaces (LOTS) and the properties of trees in whose branch spaces they embed...
Harold Bennett, David Lutzer, Mary Ellen Rudin
PODC
2004
ACM
15 years 11 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
SODA
2008
ACM
105views Algorithms» more  SODA 2008»
15 years 7 months ago
Deterministic random walks on regular trees
Jim Propp's rotor router model is a deterministic analogue of a random walk on a graph. Instead of distributing chips randomly, each vertex serves its neighbors in a fixed or...
Joshua N. Cooper, Benjamin Doerr, Tobias Friedrich...
IWANN
2009
Springer
16 years 29 days ago
Self Organized Dynamic Tree Neural Network
Cluster analysis is a technique used in a variety of fields. There are currently various algorithms used for grouping elements that are based on different methods including partiti...
Juan Francisco de Paz, Sara Rodríguez, Javi...