Volume 3,
Number 1,
2006
Volume 3,
Number 2,
2007
- André Allavena, Anirban Dasgupta, John E. Hopcroft, Ravi Kumar:
Finding (Short) Paths in Social Networks.
- Milena Mihail, Amin Saberi, Prasad Tetali:
Random Walks with Lookahead on Power Law Random Graphs.
- Marcus Fontoura, Ronny Lempel, Runping Qi, Jason Y. Zien:
Inverted Index Support for Numeric Search.
- Abraham D. Flaxman, Alan M. Frieze, Juan Vera:
A Geometric Preferential Attachment Model of Networks.
- Konstantin Avrachenkov, Dmitri Lebedev:
PageRank of Scale-Free Growing Networks.
- F. Alberto Grünbaum, Laura Felicia Matusevich:
An Identification Problem for Multiterminal Networks: Solving for the Traffic Matrix from Input-Output Measurements.
Volume 3,
Number 3,
2007
- David Gleich, Marzia Polito:
Approximating Personalized PageRank with Minimal Use of Web Graph Data.
- Ying Bao, Guang Feng, Tie-Yan Liu, Zhiming Ma, Ying Wang:
Ranking Websites: A Probabilistic View.
- Pierre Charbit, Alex D. Scott:
Infinite Locally Random Graphs.
- Thomas Erlebach, Alexander Hall, Alessandro Panconesi, Danica Vukadinovic:
Cuts and Disjoint Paths in the Valley-Free Model.
- Alan M. Frieze, Juan Vera, Soumen Chakrabarti:
The Influence of Search Engines on Preferential Attachment.
Volume 3,
Number 4,
2007
- Roger A. Horn, Stefano Serra Capizzano:
A General Setting for the Parametric Google Matrix.
385-411
- Filippo Geraci, Marco Pellegrini, Marco Maggini, Fabrizio Sebastiani:
Cluster Generation and Labeling for Web Snippets: A Fast, Accurate Hierarchical Solution.
413-443
- Ricardo A. Baeza-Yates, Paolo Boldi, Carlos Castillo:
Generic Damping Functions for Propagating Importance in Link-Based Ranking.
445-478
- Debora Donato, Stefano Leonardi, Panayiotis Tsaparas:
Stability and Similarity of Link Analysis Ranking Algorithms.
479-507
- Paola Favati, Grazia Lotti, Ornella Menchi, Francesco Romani:
A Stochastic Model for the Link Analysis of the Web.
509-531
Last update Mon Feb 13 04:50:13 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
