A Symbolic Algorithm for Maximum Flow in 0-1 Networks

Formal Methods in System Design

Volumn 10, Issue 2-3, 1997, Pages 207-219

  Hachtel, G D ^a   Somenzi, F ^a  

^a UCB 450   (United States)

Author keywords

Binary Decision Diagrams; Network algorithms; Symbolic algorithms

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; GRAPH THEORY; PROBLEM SOLVING;

BINARY DECISION DIAGRAMS (BDD); SYMBOLIC ALGORITHMS;

COMPUTER NETWORKS;

EID: 0031122217     PISSN: 09259856     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1008651924240     Document Type: Article

References (20)

1. R.I. Bahar, E.A. Frohm, C.M. Gaona, G.D. Hachtel, E. Macii, A. Pardo, and F. Somenzi, "Algebraic decision diagrams and their applications," Journal of Formal Methods in Systems Design, 1994 (to appear).
2. K.S. Brace, R.L. Rudell, and R.E. Bryant, "Efficient implementation of a BDD package," in Proceedings of the 27th Design Automation Conference, Orlando, FL, June 1990, pp. 40-45.
3. R.E. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 677-691, Aug. 1986.
4. 20 states and beyond," in Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
5. H. Cho, G.D. Hachtel, S.-W. Jeong, B. Plessier, E. Schwarz, and F. Somenzi, "ATPG aspects of FSM verification," in Proceedings of the IEEE International Conference on Computer Aided Design, Nov. 1990, pp. 134-137.
6. H. Cho, G.D. Hachtel, and F. Somenzi, "Fast sequential ATPG based on implicit state enumeration," in Proceedings of the International Test Conference, Nashville, TN, Oct. 1991, pp. 67-74.
7. H. Cho, G.D. Hachtel, and F. Somenzi, "Redundancy identification and removal based on implicit state enumeration," in Proceedings of the International Conference on Computer Design, Cambridge, MA, Oct. 1991, pp. 77-80.
8. H. Cho, S.-W. Jeong, F. Somenzi, and C. Pixley, "Synchronizing sequences and symbolic traversal techniques in test generation," Journal of Electronic Testing: Theory and Aplications, Vol. 4, pp. 19-31, 1993.
9. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, An Introduction to Algorithms, McGraw-Hill, New York, 1990.
10. O. Coudert, C. Berthet, and J.C. Madre, "Verification of sequential machines using boolean functional vectors," in L. Claesen (Ed.), Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, Leuven, Belgium, Nov. 1989, pp. 111-128.
11. E.A. Dinits, "Algorithm for solution of a problem of maximal flow in a network with power estimation," Soviet Math. Dokl., Vol. 11, pp. 1277-1280, 1970.
12. S. Even, Graph Algorithms, Computer Science Press, Rockville, MD, 1979.
13. G.D. Hachtel, M. Hermida, A. Pardo, M. Poncino, and F. Somenzi, "Re-encoding sequential circuits to reduce power dissipation," in Proceedings of the International Conference on Computer-Aided Design, San Jose, CA, Nov. 1994, pp. 70-73.
14. B. Lin and A.R. Newton, "Implicit manipulation of equivalence classes using binary decision diagrams," in Proceedings of the International Conference on Computer Design, Cambridge, MA, Oct. 1991, pp. 81-85.
15. 3) algorithm for finding maximum flows in networks, Information Processing Letters, Vol. 7, No. 6, pp. 277-278, Oct. 1978.
16. C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, 1982.
17. H. Touati, H. Savoj, B. Lin, R.K. Brayton, and A. Sangiovanni-Vincentelli, "Implicit enumeration of finite state machines using BDD's," in Proceedings of the IEEE International Conference on Computer Aided Design, Nov. 1990, pp. 130-133.
18. H.J. Touati, R.K. Brayton, and R.P. Kurshan, "Testing language containment for ω-automata using BDD's," in 1991 International Workshop on Formal Methods in VLSI Design, Miami, FL, Jan. 1991.
19. J. van Leeuwen, "Graph algorithms," in Handbook of Theoretical Computer Science [20], Ch. 10, pp. 525-631.
20. J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science, The MIT Press/Elsevier, Amsterdam, 1990.