3008 search results - page 205 / 602 » Independence in connected graphs |
184
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...
174
click to vote
IROS
2007
IEEE
16 years 27 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...
167
click to vote
SIGIR
2006
ACM
16 years 16 days ago
2006
ACM
Similarity measures for text have historically been an important tool for solving information retrieval problems. In many interesting settings, however, documents are often closel...
190
click to vote
DIAGRAMS
2004
Springer
15 years 12 months ago
2004
Springer
We describe a method for drawing graph-enhanced Euler diagrams using a three stage method. The first stage is to lay out the underlying Euler diagram using a multicriteria optimizi...
153
click to vote
GD
2008
Springer
15 years 7 months ago
2008
Springer
We introduce a new force-directed model for computing graph layout. The model bridges the two more popular force directed approaches – the stress and the electrical-spring models...