Becchetti L, Castillo C (2006) The distribution of PageRank follows a power-law only for particular values of the damping factor. In: WWW. ACM, New York, pp 941–942
Chapter
Google Scholar
Blondel V, Gajardo A, Heymans M, Senellart P, Dooren PV (2004) A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev 46(4):647–666
Article
MATH
MathSciNet
Google Scholar
Boncz P, Kersten M (1999) MIL primitives for querying a fragmented world. VLDB J 8(2):101–119
Article
Google Scholar
Borodin A, Roberts GO, Rosenthal JS, Tsaparas P (2005) Link analysis ranking: algorithms, theory, and experiments. ACM Trans Internet Technol 5(1):231–297
Article
Google Scholar
Broder A, Glassman S, Manasse M, Zweig G (1997) Syntactic clustering of the web. In: WWW, pp 393–404
Bunke H, Dickinson PJ, Kraetzl M, Wallis WD (2007) A graph-theoretic approach to enterprise network dynamics. Birkhäuser, Boston
MATH
Google Scholar
Chang F, Dean J, Ghemawat S, Hsieh WC, Wallach DA, Burrows M, Chandra T, Fikes A, Gruber RE (2006) Bigtable: a distributed storage system for structured data. In: OSDI. ACM, New York, pp 205–218
Google Scholar
Charikar M (2002) Similarity estimation techniques from rounding algorithms. In: STOC. ACM, New York, pp 380–388
Google Scholar
D’Alberto P, Dasdan A (2009) Non-parametric information-theoretic measures of one-dimensional distribution functions from continuous time series. In: SDM, pp 685–696
Dasdan A, Papadimitriou P (2007) Methods and apparatus for computing graph similarity via sequence similarity. US Patent Application, No 20090164411
Dasdan A, Papadimitriou P (2007) Methods and apparatus for computing graph similarity via signature similarity, US Patent Application, No 20090150381
Eiron N, McCurley KS, Tomlin JA (2004) Ranking the web frontier. In: WWW. ACM, New York, pp 309–318
Google Scholar
Fagin R, Kumar R, Sivakumar D (2003) Comparing top klists. SIAM J Discrete Math 17(1):134–160
Article
MATH
MathSciNet
Google Scholar
Fan J, Yao Q (2005) Nonlinear time series: nonparametric and parametric methods. Springer series in statistics, 2nd edn. Springer, New York
Google Scholar
Gibson D, Kumar R, Tomkins A (2005) Discovering large dense subgraphs in massive graphs. In: VLDB. ACM, New York, pp 721–732
Google Scholar
Henzinger MR. Finding near-duplicate web pages: a large-scale evaluation of algorithms. In: SIGIR
Jeh G, Widom J (2002) SimRank: a measure of structural-context similarity. In: KDD, Canada
Melnik S, Garcia-Molina H, Rahm E (2002) Similarity flooding: a versatile graph matching algorithm and its applications to schema matching. In: ICDE
Papadimitriou P, Dasdan A, Garcia-Molina H (2008) Web graph similarity for anomaly detection. Tech Rep 2008-1, Stanford Univ
Papadopoulos A, Manolopoulos Y (1999) Structure-based similarity search with graph histograms. In: DEXA/IWOSS. IEEE, New York, pp 174–178
Google Scholar
Robles-Kelley A, Hancock ER (2005) Graph edit distance from spectral seriation. IEEE Trans Pattern Anal Mach Intell 27(3):365–378
Article
Google Scholar
Seidl T. References for graph similarity. URL: http://www.dbs.informatik.uni-muenchen.de/~seidl/graphs/
Xue GR, Yang Q, Zeng HJ, Yu Y, Chen Z (2005) Exploiting the hierarchical structure for link analysis. In: SIGIR, New York, NY, USA, pp 186–193
Zager L, Verghese G (2005) Graph similarity. URL: http://lees.mit.edu/lees/presentations/LauraZager.pdf
Zhu P, Wilson RC (2005) A study of graph spectra for comparing graphs. In: MBVC