253 search results - page 4 / 51 » Edge and Node Searching Problems on Trees |
127
Voted
OPODIS
2008
15 years 5 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
171
Voted
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
153
Voted
WWW
2007
ACM
16 years 4 months ago
2007
ACM
Hierarchical models are commonly used to organize a Website's content. A Website's content structure can be represented by a topic hierarchy, a directed tree rooted at a...
133
Voted
INFOCOM
1996
IEEE
15 years 7 months ago
1996
IEEE
In this paper, we propose and evaluate ARIES, a heuristic for updating multicast trees dynamically in large point-to-point networks. The algorithm is based on monitoring the accum...
143
Voted
FAW
2009
Springer
15 years 10 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...