Near-perfect token distribution

DOI10.1007/3-540-55719-9_83zbMath1425.68305OpenAlexW1850357643MaRDI QIDQ5204326

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

Publication date: 4 December 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-55719-9_83

zbMATH Keywords

expander graphtoken distributionconnectivity requirementextrovert graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Strongly adaptive token distribution, Collaborative dispersion by silent robots, Unnamed Item

Cites Work

• The generalized packet routing problem
• The asymptotic number of labeled graphs with given degree sequences
• The Token Distribution Problem
• Unnamed Item