Volume 8, Numbers 1-2, 2012

Special Issue: Algorithms and Models for the Web Graph

• 
  Anthony Bonato, Ravi Kumar, D. Sivakumar: Introduction to the Special Issue on Algorithms and Models for the Web Graph. 1
• 
  Anthony Bonato, Jeannette Janssen, Pawel Pralat: Geometric Protean Graphs. 2-28
• 
  Erik D. Demaine, Morteza Zadimoghaddam: Constant Price of Anarchy in Network-Creation Games via Public-Service Advertising. 29-45
• 
  Fan R. K. Chung, Alexander Tsiatas: Finding and Visualizing Graph Clusters Using PageRank Optimization. 46-72
• 
  Francesco Bonchi, Pooya Esfandiar, David F. Gleich, Chen Greif, Laks V. S. Lakshmanan: Fast Matrix Computations for Pairwise and Columnwise Commute Times and Katz Scores. 73-112
• 
  Myunghwan Kim, Jure Leskovec: Multiplicative Attribute Graph Model of Real-World Networks. 113-160
• 
  Mihail N. Kolountzakis, Gary L. Miller, Richard Peng, Charalampos E. Tsourakakis: Efficient Triangle Counting in Large Graphs via Degree-Based Vertex Partitioning. 161-185

Volume 8, Number 3, 2012

Original Articles

• 
  Béla Bollobás, Svante Janson, Oliver Riordan: Monotone Graph Limits and Quasimonotone Graphs. 187-231
• 
  David F. Gleich, Art B. Owen: Moment-Based Estimation of Stochastic Kronecker Graph Parameters. 232-256
• 
  Evgeny A. Grechnikov: Degree Distribution and Number of Edges between Nodes of Given Degrees in the Buckley-Osthus Model of a Random Web Graph. 257-287
• 
  Maochao Xu, Shouhuai Xu: An Extended Stochastic Model for Quantitative Security Analysis of Networked Systems. 288-320

Volume 8, Number 4, 2012

Original Articles

• 
  Yilun Shang: Mean Commute Time for Random Walks on Hierarchical Scale-Free Networks. 321-337
• 
  Jeannette Janssen, Matt Hurshman, Nauzer Kalyaniwalla: Model Selection for Social Networks Using Graphlets. 338-363
• 
  A. E. L. Maftouhi, Yannis Manoussakis, O. Megalakaki: Balance in Random Signed Graphs. 364-380
• 
  Yanhua Li, Zhi-Li Zhang: Digraph Laplacian and the Degree of Asymmetry. 381-401
• 
  Peter Grindrod, Desmond J. Higham, Mark C. Parsons: Bistability through Triadic Closure. 402-423
• 
  Bruno Escoffier, Laurent Gourvès, Jérôme Monnot: Strategic Coloring of a Graph. 424-455
• 
  Enrico Bozzo, Massimo Franceschet: Approximations of the Generalized Inverse of the Graph Laplacian Matrix. 456-481