Corrections to Bierstone's Algorithm for Generating Cliques

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Corrections to Bierstone's Algorithm for Generating Cliques

Full text

Pdf (138 KB)

Source

Journal of the ACM (JACM) archive
Volume 19 , Issue 2 (April 1972) table of contents

Pages: 244 - 247

Year of Publication: 1972

ISSN:0004-5411

Authors

Gordon D. Mulligan	Placer Development Ltd., Vancouver, B.C., Canada and University of Toronto, Toronto, Ontario, Canada
D. G. Corneil	Placer Development Ltd., Vancouver, B.C., Canada and University of Toronto, Toronto, Ontario, Canada

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 15, Downloads (12 Months): 52, Citation Count: 10

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321694.321698 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	J. Gary Augustson , Jack Minker, An Analysis of Some Graph Theoretical Cluster Techniques, Journal of the ACM (JACM), v.17 n.4, p.571-588, Oct. 1970 [doi>10.1145/321607.321608]
	2	, BIERSTONE, E. Cliques and generalized cliques in a finite linear graph. Unpublished report.
	3	BRON, COEN, AND KERBOSCH, JOEP A. G.M. Private communication.
	4	MULLIGAN, G.D. Algorithms for finding cliques of a graph. M.Sc. thesis, Dep. of Computer Sei., U. of Toronto, Toronto, Ontario, Can.

CITED BY 10

	Robert M. Haralick, The Diclique Representation and Decomposition of Binary Relations, Journal of the ACM (JACM), v.21 n.3, p.356-366, July 1974
	Chung C. Wang, An Algorithm for the Chromatic Number of a Graph, Journal of the ACM (JACM), v.21 n.3, p.385-391, July 1974
	Coen Bron , Joep Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, v.16 n.9, p.575-577, Sept. 1973
	W. A. Burkhard , R. M. Keller, Some approaches to best-match file searching, Communications of the ACM, v.16 n.4, p.230-236, April 1973
	C. J. Tseng , D. P. Siewiorek, Facet: A procedure for the automated synthesis of digital systems, Papers on Twenty-five years of electronic design automation, p.566-572, June 1988
	Chia-Jeng Tseng , Daniel P. Siewiorek, Facet: A procedure for the automated synthesis of digital systems, Proceedings of the 20th conference on Design automation, p.490-496, June 27-29, 1983, Miami Beach, Florida, United States
	Mohammed J. Zaki, Scalable Algorithms for Association Mining, IEEE Transactions on Knowledge and Data Engineering, v.12 n.3, p.372-390, May 2000
	Matthew C. Schmidt , Nagiza F. Samatova , Kevin Thomas , Byung-Hoon Park, A scalable, parallel algorithm for maximal clique enumeration, Journal of Parallel and Distributed Computing, v.69 n.4, p.417-428, April, 2009
	Hongtao Tian , Sanjay K. Bose , Choi Look Law , Wendong Xiao, Joint routing and flow rate optimization in multi-rate ad hoc networks, Computer Networks: The International Journal of Computer and Telecommunications Networking, v.52 n.3, p.739-764, February, 2008
	Yida Wang , Ee-Peng Lim , San-Yih Hwang, Efficient algorithms for mining maximal valid groups, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.3, p.515-535, May 2008