ACM Home Page
Please provide us with feedback. Feedback
Remark on “Algorithm 479: A Minimal Spanning Tree Clustering Method [Z]”
Full text PdfPdf (90 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 ,  Issue 1  (March 1976) table of contents
Pages: 110 - 111  
Year of Publication: 1976
ISSN:0098-3500
Authors
G. M. White  Computer Science Department, University of Ottawa, Ottawa, Ont. Canada K1N 6N5
S. Goudreau  Computer Science Department, University of Ottawa, Ottawa, Ont. Canada K1N 6N5
J. L. Legros  Computer Science Department, University of Ottawa, Ottawa, Ont. Canada K1N 6N5
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 2,   Downloads (12 Months): 13,   Citation Count: 0
Additional Information:

references   index terms   collaborative colleagues   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/355666.355678
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
 
1
MAGNUSKI, H.S. Remark on Algorithm 479. Comm. ACM 18, 2(Feb. 1975), 119.

Collaborative Colleagues:
G. M. White: colleagues
S. Goudreau: colleagues
J. L. Legros: colleagues

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