Fetching the paper…
Reading the bibliography…
It was experimentally observed that the majority of real-world networks follow power law degree distribution.
The asymptotic number of labeled graphs with given degree sequences
E. A. Bender and E. R. Canfield · 1978
Earlier work this paper cites.
On determinants, matchings, and random algorithms
L. Lovász · 1979
Earlier work this paper cites.
A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
B. Bollobás · 1980
Earlier work this paper cites.
An O ( | V | | E | ) O(\sqrt{|V|}|E|) algorithm for finding maximum matching in general graphs
S. Micali and V. V. Vazirani · 1980
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
N. Chiba and T. Nishizeki · 1985
Earlier work this paper cites.
Fast algorithms for the characteristics polynomial
W. Keller-Gehrig · 1985
Earlier work this paper cites.
The evolution of the minimum degree ordering algorithm
A. George and J. W. Liu · 1989
Earlier work this paper cites.
Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems
C. D. Meyer · 1989
Earlier work this paper cites.
An exact algorithm for the maximum clique problem
R. Carraghan and P. M. Pardalos · 1990
Earlier work this paper cites.
Processor efficient parallel solution of linear systems over an abstract field
E. Kaltofen and V. Pan · 1991
Earlier work this paper cites.
Nonnegative Matrices in the Mathematical Sciences
A. Berman and R. Plemmons · 1994
Earlier work this paper cites.
Polynomial and Matrix Computations
D. Bini and V. Pan · 1994
Earlier work this paper cites.
Matrix Computations (3rd Ed.)
G. H. Golub and C. F. Van Loan · 1996
Earlier work this paper cites.
Finding and counting given length cycles
N. Alon, R. Yuster, and U. Zwick · 1997
Earlier work this paper cites.
Emergence of scaling in random networks
A.-L. Barabási and R. Albert · 1999
Earlier work this paper cites.
Random graph models for the web graph
R. Kumar, P. Raghavan, S. Rajagopalan, D. Sivakumar, A. Tomkins, and E. Upfal · 2000
Earlier work this paper cites.
A random graph model for power law graphs
W. Aiello, F. C. Graham, and L. Lu · 2001
Earlier work this paper cites.
The degree sequence of a scale-free random graph process
B. Bollobás, O. Riordan, J. Spencer, and G. E. Tusnády · 2001
Cited alongside, same era.
A general model of undirected web graphs
C. Cooper and A. M. Frieze · 2001
Cited alongside, same era.
Random graphs with arbitrary degree distributions and their applications
M. E. Newman, S. H. Strogatz, and D. J. Watts · 2001
Cited alongside, same era.
Deterministic computation of the frobenius form
A. Storjohann · 2001
Cited alongside, same era.
Statistical mechanics of complex networks
R. Albert and A.-L. Barabási · 2002
Cited alongside, same era.
Asymptotically efficient algorithms for the Frobenius form
W. Eberly · 2003
Cited alongside, same era.
Affiliation networks
S. Lattanzi and D. Sivakumar · 2009
Later among the works it cites.
Large cliques in a power-law random graph
S. Janson, T. Łuczak, I. Norros, et al · 2010
Later among the works it cites.
Social networks spread rumors in sublogarithmic time
B. Doerr, M. Fouz, and T. Friedrich · 2011
Later among the works it cites.
Characterizing and modeling citation dynamics
Y.-H. Eom and S. Fortunato · 2011
Later among the works it cites.
Emergence of double scaling law in complex systems
Han, D. D., Qian, J. H., and Ma, Y. G · 2011
Later among the works it cites.
Fast algorithms for max independent set
N. Bourgeois, B. Escoffier, V. T. Paschos, and J. M. M. van Rooij · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
G. Csányi and B. Szendrői · 2004
Cited alongside, same era.
Maximum matchings via gaussian elimination
M. Mucha and P. Sankowski · 2004
Cited alongside, same era.
Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time
D. A. Spielman and S.-H. Teng · 2004
Cited alongside, same era.
Generating simple random graphs with prescribed degree distribution
T. Britton, M. Deijfen, and A. Martin-Löf · 2006
Cited alongside, same era.
Strong computational lower bounds via parameterized complexity
J. Chen, X. Huang, I. A. Kanj, and G. Xia · 2006
Cited alongside, same era.
On the hardness of optimization in power law graphs
A. Ferrante, G. Pandurangan, and K. Park · 2007
Cited alongside, same era.
F. Le Gall · 2012
Later among the works it cites.
SNAP Datasets: Stanford large network dataset collection
J. Leskovec and A. Krevl · 2012
Later among the works it cites.
Fast local search for the Steiner problem in graphs
E. Uchoa and R. F. Werneck · 2012
Later among the works it cites.
Multiplying matrices faster than Coppersmith-Winograd
V. V. Williams · 2012
Later among the works it cites.
Steiner tree approximation via iterative randomized rounding
J. Byrka, F. Grandoni, T. Rothvoss, and L. Sanità · 2013
Later among the works it cites.
Set covering with our eyes closed
F. Grandoni, A. Gupta, S. Leonardi, P. Miettinen, P. Sankowski, and M. Singh · 2013
Later among the works it cites.
Navigating central path with electrical flows: From flows to matchings, and back
A. Madry · 2013
Later among the works it cites.
Why do simple algorithms for triangle enumeration work in the real world?
J. W. Berry, L. K. Fostvedt, D. J. Nordman, C. A. Phillips, C. Seshadhri, and A. G. Wilson · 2014
Later among the works it cites.
E. A. Grechnikov · 2014
Later among the works it cites.
Openflights.org
J. Patokallio · 2015
Closest in time.