Sciweavers

TKDE
2012
198views Formal Methods» more  TKDE 2012»
11 years 7 months ago
Distributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
— Most proposed DHTs engage certain topology maintenance mechanisms specific to the static graphs on which they are based. The designs of these mechanisms are complicated and rep...
Yiming Zhang, Ling Liu
INFOCOM
2012
IEEE
11 years 7 months ago
Harnessing Internet topological stability in Thorup-Zwick compact routing
—Thorup-Zwick (TZ) compact routing guarantees sublinear state growth with the size of the network by routing via landmarks and incurring some path stretch. It uses a pseudo-rando...
Stephen D. Strowes, Colin Perkins
MOBICOM
2012
ACM
11 years 7 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ICDM
2006
IEEE
149views Data Mining» more  ICDM 2006»
13 years 11 months ago
Pattern Mining in Frequent Dynamic Subgraphs
Graph-structured data is becoming increasingly abundant in many application domains. Graph mining aims at finding interesting patterns within this data that represent novel knowl...
Karsten M. Borgwardt, Hans-Peter Kriegel, Peter Wa...
KDD
2005
ACM
140views Data Mining» more  KDD 2005»
14 years 5 months ago
Graphs over time: densification laws, shrinking diameters and possible explanations
How do real graphs evolve over time? What are "normal" growth patterns in social, technological, and information networks? Many studies have discovered patterns in stati...
Jure Leskovec, Jon M. Kleinberg, Christos Faloutso...