scientific article; zbMATH DE number 1380616

DOI<87::AID-RSA5>3.0.CO;2-O 10.1002/(SICI)1098-2418(1999010)14:1<87::AID-RSA5>3.0.CO;2-OzbMath0962.05056MaRDI QIDQ4705352

Eli Upfal, Andrei Z. Broder, Alan M. Frieze

Publication date: 19 December 1999

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmrandom walkscommunication networkspathPoisson processesmulticommodity flowcircuit switchingexpander graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items

Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs, Random Walks and Forbidden Minors I: An $n^{1/2+o(1)}$-Query One-Sided Tester for Minor Closed Properties on Bounded Degree Graphs

Cites Work

• Explicit construction of linear sized tolerant networks
• Ramanujan graphs
• Eigenvalues and expanders
• Approximate counting, uniform generation and rapidly mixing Markov chains
• Graph minors. XIII: The disjoint paths problem
• Existence and Construction of Edge-Disjoint Paths on Expander Graphs