Cuts and Flows in Infinite Periodic Graphs; Application to the Minimization of Circuit Registers - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

Cuts and Flows in Infinite Periodic Graphs; Application to the Minimization of Circuit Registers

Bruno Gaujal
Jean Mairesse
  • Fonction : Auteur
  • PersonId : 831681

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.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4144.pdf (367.53 Ko) Télécharger le fichier

Dates et versions

inria-00072480 , version 1 (24-05-2006)
inria-00072480 , version 2 (24-07-2007)

Identifiants

  • HAL Id : inria-00072480 , version 1

Citer

Bruno Gaujal, Jean Mairesse. Cuts and Flows in Infinite Periodic Graphs; Application to the Minimization of Circuit Registers. [Research Report] RR-4144, 2001. ⟨inria-00072480v1⟩

Collections

INRIA-RRRT
200 Consultations
361 Téléchargements

Partager

Gmail Facebook X LinkedIn More