The number of steps and the final configuration of relaxation procedures on graphs

DOI10.1016/J.DAM.2014.08.024MaRDI QIDQ479017zbMATH OpenOpenAlexFDO

Authors Sheng-Hua Chen, Gerard Jennhwa Chang

Publication date 5 December 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2014.08.024

zbMATH Keywords

number of stepsconfigurationpentagon gamerelaxation procedure

Mathematics Subject Classification ID

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

Recommendations

• Relaxation procedures on graphs
• Strong convergence and a game of numbers
• scientific article; zbMATH DE number 4099379
• Chip-firing games on graphs
• scientific article; zbMATH DE number 140102

Cites work

• Convergence of Mozes's game of numbers
• Eriksson's numbers game and finite Coxeter groups
• Reflection Sequences
• Reflection processes on graphs and Weyl groups
• Relaxation procedures on graphs

Cited in

(1)

• Relaxation procedures on graphs

This page was built for publication: The number of steps and the final configuration of relaxation procedures on graphs

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