Relaxation procedures on graphs

DOI10.1016/j.dam.2007.11.023zbMath1220.05123OpenAlexW2054550043MaRDI QIDQ1026124

Christian Reiher, Elias Wegert

Publication date: 24 June 2009

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

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

zbMATH Keywords

sortingcircle packinggraph algorithmselectrical networksdiscrete harmonic functionsIMO problemsreflection processessigned mean values

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The number of steps and the final configuration of relaxation procedures on graphs ⋮ Weighted Coxeter graphs and generalized geometric representations of Coxeter groups

Uses Software

• CirclePack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convergence of Mozes's game of numbers
• Minuscule elements of Weyl groups, the numbers game, and \(d\)-complete posets
• Reachability is decidable in the numbers game
• Problem-solving strategies
• Some combinatorial problems
• Reflection processes on graphs and Weyl groups
• The numbers game and Coxeter groups
• Strong convergence and a game of numbers
• Combinatorics of Coxeter Groups
• Reflection Sequences

This page was built for publication: Relaxation procedures on graphs