19 June 2006 in Algorithmica
23 January 2012 in Networks
14 January 2010 in Theoretical Computer Science
1 January 2007 in Combinatorics, Probability and Computing
A black hole is a highly harmful stationary process residing in a node of a network and destroying all mobile agents visiting the node, without leaving any trace. We consider the task of locating a black hole in a (partially) synchronous tree network, assuming an upper bound on the time of any edge traversal by an agent. The minimum number of agents capable of identifying a black hole is two. For a given tree and given starting node we are interested in the fastest-possible black hole search by two agents. For arbitrary trees we give a 5/3-approximation algorithm for this problem. We give optimal black hole search algorithms for two ‘extreme’ classes of trees: the class of lines and the class of trees in which any internal node (including the root which is the starting node) has at least two children.
11 July 2009 in Journal of Computer and System Sciences
28 July 2006 in Discrete Mathematics
An -labeling of a graph is an integer labeling of vertices of , such that adjacent vertices have labels which differ by at least , and vertices at distance two have labels which differ by at least . The span of an -labeling is the difference between the largest and the smallest label. We investigate -labelings of trees of maximum degree , seeking those with small span. Given , and , span is optimal for the class of trees of maximum degree , if is the smallest integer such that every tree of maximum degree has an -labeling with span at most . For all parameters , such that , we construct -labelings with optimal span. We also establish optimal span of -labelings for stars of arbitrary degree and all values of and .