3008 search results - page 257 / 602 » Independence in connected graphs |
201
click to vote
DAM
2002
15 years 6 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...
170
click to vote
JACM
2000
15 years 6 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
180
click to vote
ACL
2010
15 years 4 months ago
2010
Wikipedia articles in different languages are connected by interwiki links that are increasingly being recognized as a valuable source of cross-lingual information. Unfortunately,...
183
click to vote
CDC
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider a network of control systems connected over a graph. Considering the graph structure as constraints on the set of permissible controllers, we show that such systems ar...
173
click to vote
GIS
2010
ACM
15 years 4 months ago
2010
ACM
Recording the location of people using location-acquisition technologies, such as GPS, allows generating life patterns, which associate people to places they frequently visit. Con...