Near-perfect token distribution

DOI10.1007/3-540-55719-9_83MaRDI QIDQ5204326zbMATH OpenOpenAlexFDO

Authors Andrei Broder, Eli Shamir, Eli Upfal, Alan 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

connectivity requirementexpander graphextrovert graphstoken distribution

Mathematics Subject Classification ID

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

Recommendations

• Near‐perfect token distribution
• The Token Distribution Problem
• Structural Information and Communication Complexity
• scientific article; zbMATH DE number 1267563
• Strongly adaptive token distribution

Cites work

• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• The asymptotic number of labeled graphs with given degree sequences
• The generalized packet routing problem
• The Token Distribution Problem

Cited in

(8)

• The Token Distribution Problem
• scientific article; zbMATH DE number 1267563 (Why is no real title available?)
• Near‐perfect token distribution
• Strongly adaptive token distribution
• scientific article; zbMATH DE number 7561459 (Why is no real title available?)
• Structural Information and Communication Complexity
• Collaborative dispersion by silent robots
• Cubical token systems

This page was built for publication: Near-perfect token distribution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204326)