1. R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ, 1993).
2. G. Ausiello, A. D’Atri and D. Saccà, Graph algorithms for functional dependency manipulation,Journal of ACM 30 (1983) 752–766.
3. Technical Report;R. Cambini,1992
4. G. Gallo, F. Licheri and M.G. Scutellà, The hypergraph simplex approach: Some experimental results,Ricerca Operativa ANNO XXVI, 78 (1996) 21–54.
5. G. Gallo, G. Longo, S. Nguyen and S. Pallottino, Directed hypergraphs and applications,Discrete Applied Mathematics 42 (1993) 177–201.