4865 search results - page 270 / 973 » The Complexity of Graph Connectivity |
166
click to vote
COCOON
2008
Springer
15 years 8 months ago
2008
Springer
We study the problem of adding k new links to a directed graph G(V, E) in order to maximize the minimum PageRank value for a given subset of the nodes. We show that this problem is...
217
click to vote
IRCDL
2010
15 years 8 months ago
2010
One of the most challenging issues in managing the large and diverse data available on the World Wide Web is the design of interactive systems to organize and represent information...
353
click to vote
CSL
2011
Springer
15 years 1 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
186
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
175
click to vote
IROS
2007
IEEE
16 years 28 days ago
2007
IEEE
Abstract— In this paper, we present an optimization framework for target tracking with mobile robot teams. The target tracking problem is modeled as a generic semidefinite progr...