An improved direct labeling method for the max-flow min-cut computation in large hypergraphs and applications

International Transactions in Operational Research

Volumn 10, Issue 1, 2003, Pages 1-11

  Pistorius, Joachim ^a   Minoux, Michel ^b  

^a ALTERA CORPORATION   (United States)

^b SORBONNE UNIVERSITÉ   (France)

Author keywords

Graph theory; Hypergraph; Maximum flow problem; Minimum cut; Optimization

Indexed keywords

EID: 24644509466     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/1475-3995.00389     Document Type: Article

References (19)

1. Ahuja, R.K., Magnanti, T. L., Orlin, J. B., 1993. Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs.
2. Alpert, C. J., 1996. ‘Multi-way Graph and Hypergraph Partitioning’, Ph. D. Dissertation, University of California, Los Angeles. Beasley, J. E., 2000. ‘OR-Notes’ http://www.ms.ic.ac.uk/jeb/or/netflow.html
3. Cambini, R., Gallo, G., Scutella, M. G., 1997. ‘Flows on Hypergraphs’, Mathematical Programming 78, 195-217.
4. Dinic, E. A., 1970. ‘Algorithms for Solution of a Problem of Maximum Flow in Networks with Power Estimation’, Soviet Math. Dokladyll, 1277-1280.
5. Edmonds, J., Karp, R. M., 1972. ‘Theoretical improvements in algorithmic efficiency for network flow problems’, Journal of the Association for Computing Machinery 19(2), 248-264.
6. Ford, L. R. Jr., Fulkerson, D. R., 1962. Flows in Networks, Princeton University Press, Princeton, NJ.
7. Goldberg, A. V., Tarjan, R. E., 1988. ‘A New Approach to the Maximum-Flow Problem’, Journal of the Association for Computing Machinery, 35(4), 921-940.
8. Goldberg, A. V., Rao, S., 1997. ‘Beyond the Flow Decomposition Barrier’, Proceedings of the IEEE Symposium on Foundations of Computer Science, 2-11.
9. Gomory, R. E., Hu, T. C., 1961. ‘Multi-Terminal Network Flows’, Journal of the SIAM 9, 551-570.
10. Hu, T. C., 1963. ‘Multi-Commodity Network Flows’, Operations Research 11, 344-360.
11. Hu, T. C., Moerder, K., 1985. ‘Multiterminal Flows in a Hypergraph’, In:T. C.Hu and Ku (Eds), VLSI Circuit Layout: Theory and Designpp. 87-93.IEEE Press.
12. Ihler, E., Wagner, D., Wagner E., 1993. ‘Modeling Hypergraphs by Graphs with the Same Mincut Properties’, Information Processing Letters 45(4); 171-175.
13. Kuo, M.-T., Cheng, C.-K., 1997. ‘A Network Flow Approach for Hierarchical Tree Partitioning’, Proc. 34th ACM/IEEE Design Automation Conference, 512-517.
14. Lawler, E. L., 1973. ‘Cutsets and Partitions of Hypergraphs’, Networks 3, 275-285.
15. Lawler, E. L., 1976. Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston.
16. Liu, H., Wong, D. F., 1998. ‘Network Flow Based Multi-Way Partitioning with Area and Pin Constraints’, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17(1), 50-59.
17. Pistorius J., Legai, E., Minoux, M., 1999. ‘Generation of Very Large Circuits to Benchmark and Partitioning of FPGAs’, Proc. ACM International Symposium on Physical Design, 67-73.
18. Rational Software Corporation, 2000. ‘Quantify User’s Guide Rational Software Corporation, http://www.rational.com Rardin, R.L., 1997. Optimization in Operations Research, Prentice Hall, Englewood Cliffs.
19. Yang, H. H., Wong, D. F., 1996. ‘Efficient Network Flow Based Min-Cut Balanced Partitioning’, IEEE Transactions on Computer-Aided Design 15(12), 1533-1540.