Sciweavers

3757 search results - page 449 / 752
» The overlap number of a graph
Sort
View
ICALP
2007
Springer
16 years 25 days ago
Labeling Schemes for Vertex Connectivity
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...
Amos Korman
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
16 years 24 days ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
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...
Matthias Müller-Hannemann, Siamak Tazari
GLOBECOM
2006
IEEE
16 years 22 days ago
On the Search of Internet AS-level Topology Invariants
— 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...
Lung-de Shyu, Seng-Yong Lau, Polly Huang
IROS
2006
IEEE
108views Robotics» more  IROS 2006»
16 years 21 days ago
Sparse appearance based modeling for robot localization
— 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...
Olaf Booij, Zoran Zivkovic, Ben J. A. Kröse
ATAL
2005
Springer
16 years 6 days ago
Efficient information retrieval using mobile agents
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...
Irene Sygkouna, Miltiades E. Anagnostou