Culberson and Rudnicki [1] gave an algorithm that reconstructs a degree d restricted tree from its distance matrix. According to their analysis, it runs in time O(dn logd n) for t...
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
The analysis of social and technological networks has attracted a lot of attention as social networking applications and mobile sensing devices have given us a wealth of real data...
John Tang, Mirco Musolesi, Cecilia Mascolo, Vito L...
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion...