Cuts and Flows in Infinite Periodic Graphs; Application to the Minimization of Circuit Registers
Résumé
In this paper, we prove that bi-infinite and causal periodic graphs admit periodic maximal flows and consecutive minimal cuts. By viewing such a graph as the unfolding of the dependences in a digital circuit, we also show how this can be used for register minimization in circuit design.