3471 search results - page 402 / 695 » Obstacle Numbers of Graphs |
202
click to vote
PKDD
2007
Springer
16 years 25 days ago
2007
Springer
Recent years have seen the development of many graph clustering algorithms, which can identify community structure in networks. The vast majority of these only find disjoint commun...
143
click to vote
GLOBECOM
2006
IEEE
16 years 23 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...
170
click to vote
IROS
2006
IEEE
16 years 22 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...
173
click to vote
ATAL
2005
Springer
16 years 7 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...
145
click to vote
COCOON
2005
Springer
16 years 7 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 ...