ACM Home Page
Please provide us with feedback. Feedback
A symbolic algorithm for maximum flow in 0-1 networks
Full text PdfPdf (456 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design table of contents
Santa Clara, California, United States
Pages: 403 - 406  
Year of Publication: 1993
ISBN:0-8186-4490-7
Authors
Gary D. Hachtel  Department of Electrical and Computer Engineering, University of Colorado at Boulder, 80309
Fabio Somenzi  Department of Electrical and Computer Engineering, University of Colorado at Boulder, 80309
Sponsors
IEEE-CS : Computer Society
SIGDA: ACM Special Interest Group on Design Automation
Publisher
IEEE Computer Society Press  Los Alamitos, CA, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 9,   Citation Count: 6
Additional Information:

references   cited by   collaborative colleagues  

Tools and Actions: Review this Article  

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
J.R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the Fifth Annual Symposium on Logic in Computer Science, June 1990.
 
4
H. Cho, G. D. Hachtel, S.-W. Jeong, B. Plessier, E. Schwarz, and F. Somen~i. ATPG aspects of FSM verification. In Proceeding~ of the IEEE International Conference on Compute~ Aided Design, pages 134-137, November 1990.
 
5
H. Cho, G. D. Hachtel, and F. Somen~i. Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration. IEEE Transactions on Computer- Aided Design of integrated Circuit~ and Systems, 1993. To appear.
 
6
 
7
O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines using boolean functional vectors. In L. Claesen, editor, Proceedings IFIP International Workshop on Applied Formal Methods for Correct VLSI Design, pages 111- 128, Leuven, Belgium, November 1989.
 
8
E. A. Dinits. Algorithm for solution of a problem of maximal flow in a network with power estimation. Soviet Math. Dokl., 11:1277-1280, 1970.
 
9
 
10
V. M. Malhotra~ M. Pramodh Kumar, and S. N. Maheshwary. An O(IV{ ) algorithm for finding maximum flows in networks. Information Processing Letters, 7(6):277-278, October 1978.

CITED BY  6
Collaborative Colleagues:
Gary D. Hachtel: colleagues
Fabio Somenzi: colleagues