1952 search results - page 202 / 391 » Complete partitions of graphs |
154
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
We introduce overlap cluster graph modification problems where, other than in most previous work, the clusters of the target graph may overlap. More precisely, the studied graph p...
138
click to vote
GLOBECOM
2006
IEEE
16 years 18 days ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
167
click to vote
SODA
2000
ACM
15 years 7 months ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
159
click to vote
ICRA
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract— This paper describes a new algorithm for cooperative and persistent simultaneous localization and mapping (SLAM) using multiple robots. Recent pose graph representation...
158
click to vote
JCT
2010
15 years 1 months ago
2010
It is well-known that, of all graphs with edge-density p, the random graph G(n, p) contains the smallest density of copies of Kt,t, the complete bipartite graph of size 2t. Since ...