ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
A Flow Analysis Algorithm
Full text PdfPdf (387 KB)
Source Journal of the ACM (JACM) archive
Volume 11 ,  Issue 4  (October 1964) table of contents
Pages: 429 - 436  
Year of Publication: 1964
ISSN:0004-5411
Author
Lee Krider  Lawrence Radiation Laboratory, University of California, Livermore, California
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 23,   Citation Count: 3
Additional Information:

cited by   index terms  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/321239.321244
What is a DOI?

CITED BY  3
Paul E. Hamburger, On an automated method, Proceedings of the 1966 21st national conference, p.321-330, January 1966
A. T. Berztiss, A Backtrack Procedure for Isomorphism of Directed Graphs, Journal of the ACM (JACM), v.20 n.3, p.365-377, July 1973
Lyle G. Hartman, Edge-labeled directed graphs in APL, Proceedings of seventh international conference on APL, p.181-187, June 11-13, 1975, Pisa, Italy

INDEX TERMS

Primary Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING

Additional Classification:
  D. Software
  D.2 SOFTWARE ENGINEERING
      D.2.2 Design Tools and Techniques
          Subjects: Flow charts


General Terms:
Algorithms, Performance, Theory, Verification


The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player