This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
— There has been a significant amount of work analyzing the Internet AS (Autonomous System)-level topology which gives rise to a number of topology models. Although each of thes...
— In appearance based robot localization a new image is matched with every image in the database. In this paper we describe how to reduce the number of images in this database wi...
We are concerned with the use of Mobile Agents for information retrieval. A multi-agent system is considered; a number of agents are involved in a collective effort to retrieve di...