Università di Pisa
Sistema bibliotecario di ateneo

Flows on hypergraphs

Cambini, Riccardo and Gallo, Giorgio and Scutellà, Maria Grazia (1996) Flows on hypergraphs. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.

[img] Postscript (GZip) - Published Version
Available under License Creative Commons Attribution No Derivatives.

Download (112Kb)


    We consider the capacitated minimum cost flow problem on directed hypergraphs. We define spanning hypertrees so generalizing the spanning tree of a standard graph, and show that, like in the standard and in the generalized minimum cost flow problems, a correspondence exists between bases and spanning hypertrees. Then, we show that, like for the network simplex algorithms for the standard and for the generalized minimum cost flow problems, most of the computations performed at each pivot operation have direct hypergraph interpretations.

    Item Type: Book
    Uncontrolled Keywords: Flows, hypergraphs
    Subjects: Area01 - Scienze matematiche e informatiche > INF/01 - Informatica
    Divisions: Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA
    Depositing User: dott.ssa Sandra Faita
    Date Deposited: 26 Jan 2015 08:42
    Last Modified: 26 Jan 2015 08:42
    URI: http://eprints.adm.unipi.it/id/eprint/1928

    Repository staff only actions

    View Item