13 search results - page 2 / 3 » A New Algorithm for Finding Minimal Cycle-Breaking Sets of T... |
CIKM
2007
Springer
13 years 9 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
IEEESCC
2009
IEEE
13 years 3 months ago
2009
IEEE
In this paper we look at combining and compressing a set of workflows, such that computation can be minimized. In this context, we look at two novel theoretical problems with appl...
GIS
2007
ACM
13 years 9 months ago
2007
ACM
A frequent query in geospatial planning and decision making domains (e.g., emergency response, data acquisition, street cleaning), is to find an optimal traversal plan (OTP) that ...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
In this paper, we study the spread of influence through a social network, in a model initially studied by Kempe, Kleinberg and Tardos [14, 15]: We are given a graph modeling a soc...
TACAS
2010
Springer
13 years 3 months ago
2010
Springer
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...