Chipping away at the edges: how long does it take?

DOI10.4310/JOC.2012.v3.n1.a5zbMath1269.05070OpenAlexW2314945607MaRDI QIDQ353403

Paweł Prałat, O-Yeat Chan

Publication date: 12 July 2013

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2012.v3.n1.a5

zbMATH Keywords

Single-node traffic flow process, graph searching, chip-firing game

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (2)

Meteor process on \({\mathbb Z}^d\) ⋮ On meteors, earthworms and wimps

This page was built for publication: Chipping away at the edges: how long does it take?