Sciweavers

1154 search results - page 62 / 231
» On the editing distance of graphs
Sort
View
IPL
2007
89views more  IPL 2007»
13 years 9 months ago
On the longest path algorithm for reconstructing trees from distance matrices
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...
Lev Reyzin, Nikhil Srivastava
CIKM
2009
Springer
14 years 4 months ago
Fast shortest path distance estimation in large networks
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...
SIGCOMM
2009
ACM
14 years 4 months ago
Temporal distance metrics for social network analysis
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...
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 10 months ago
The Causal Graph Revisited for Directed Model Checking
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...
Martin Wehrle, Malte Helmert
AIPS
2000
13 years 11 months ago
Distance-Based Goal-Ordering Heuristics for Graphplan
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...
Subbarao Kambhampati, Romeo Sanchez Nigenda