Abstract
In this paper we address min-max equations for periodic and non-periodic problems. In the non-periodic case a simple algorithm is presented to determine whether a graph has a potential satisfying the min-max equations. This method can also be used to solve a more general quasi periodic min-max problem on periodic graphs. Also some results regarding the uniqueness of solutions in the latter case are given.
Cite
CITATION STYLE
Schwiegelshohn, U., & Thiele, L. (1997). Periodic and non-periodic min-max equations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1256, pp. 379–389). Springer Verlag. https://doi.org/10.1007/3-540-63165-8_194
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
