Coding distributive lattices with Edge Firing Games.

DOI10.1016/S0020-0190(01)00319-2zbMath1043.68080arXivmath/0110214MaRDI QIDQ1853051

Clémence Magnien, Matthieu Latapy

Publication date: 21 January 2003

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

Combinatorial problemsDistributive latticeChip Firing GameDiscrete dynamical modelEdge Firing GameOrientations of graphsSource Reversal Game

Mathematics Subject Classification ID

Partial orders, general (06A06) Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (5)

Decomposition theorem on matchable distributive lattices ⋮ Enumerating degree sequences in digraphs and a cycle--cocycle reversing system ⋮ On reorienting graphs by pushing down maximal vertices. II ⋮ A geometric approach to acyclic orientations ⋮ Characterization of simple edge-firing games.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chip-firing games on graphs
• On reorienting graphs by pushing down maximal vertices
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• The lattice structure of chip firing games and related models

This page was built for publication: Coding distributive lattices with Edge Firing Games.