A symbolic algorithm for maximum flow in 0-1 networks
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- ATPG aspects of FSM verificationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Efficient implementation of a BDD packagePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Redundancy identification/removal and test generation for sequential circuits using implicit state enumerationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1993
- Algebraic decision diagrams and their applicationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- An O(|V|3) algorithm for finding maximum flows in networksInformation Processing Letters, 1978