4171 search results - page 443 / 835 » Choice numbers of graphs |
183
click to vote
WADS
2007
Springer
16 years 29 days ago
2007
Springer
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...
148
click to vote
GLOBECOM
2006
IEEE
16 years 27 days ago
2006
IEEE
— 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...
178
click to vote
IROS
2006
IEEE
16 years 26 days ago
2006
IEEE
— 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...
186
click to vote
ATAL
2005
Springer
16 years 12 days ago
2005
Springer
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...
149
click to vote
COCOON
2005
Springer
16 years 12 days ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...