Lattices generated by chip firing game models: criteria and recognition algorithms

DOI10.1016/j.ejc.2012.12.008zbMath1288.06008arXiv1205.6256OpenAlexW2135651774MaRDI QIDQ1943390

Trung van Pham, Thi Ha Duong Phan

Publication date: 19 March 2013

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

Full work available at URL: https://arxiv.org/abs/1205.6256

zbMATH Keywords

polynomial-time algorithmchip firing gamesupper locally distributive lattices

Mathematics Subject Classification ID

Games involving graphs (91A43) Structure theory of lattices (06B05) Graph algorithms (graph-theoretic aspects) (05C85) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (3)

Chip-firing game and a partial Tutte polynomial for Eulerian digraphs ⋮ Elimination schemes and lattices ⋮ Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of chip-firing game on directed graphs

This page was built for publication: Lattices generated by chip firing game models: criteria and recognition algorithms