Conductance and congestion in power law graphs

This publication has 21 references indexed in Scilit:

• The Average Distance in a Random Graph with Given Expected Degrees
  Internet Mathematics, 2004
• Using the small-world model to improve freenet performance
  ACM SIGCOMM Computer Communication Review, 2002
• The degree sequence of a scale‐free random graph process
  Random Structures & Algorithms, 2001
• On the origin of power laws in Internet topologies
  ACM SIGCOMM Computer Communication Review, 2000
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
  Journal of the ACM, 1999
• The Size of the Giant Component of a Random Graph with a Given Degree Sequence
  Combinatorics, Probability and Computing, 1998
• The geometry of graphs and some of its algorithmic applications
  Combinatorica, 1995
• A critical point for random graphs with a given degree sequence
  Random Structures & Algorithms, 1995
• On rearrangeable and non-blocking switching networks
  Journal of Computer and System Sciences, 1978
• Superconcentrators
  SIAM Journal on Computing, 1977