ACM Home Page
Please provide us with feedback. Feedback
An Algorithm for Finding a Minimal Equivalent Graph of a Digraph
Full text PdfPdf (328 KB)
Source Journal of the ACM (JACM) archive
Volume 22 ,  Issue 1  (January 1975) table of contents
Pages: 11 - 16  
Year of Publication: 1975
ISSN:0004-5411
Author
Harry T. Hsu  Department of Computer Science, Colorado State University, Fort Collins, Colorado
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 54,   Citation Count: 4
Additional Information:

references   cited by   index terms   peer to peer  

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/321864.321866
What is a DOI?

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
BERZTISS, A T Data Structures. Academic Press, New York, 1971.



Peer to Peer - Readers of this Article have also read: