Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science,Information Systems,Theoretical Computer Science,Software
Reference13 articles.
1. E. A. Akkoyunlu, The enumeration of maximal cliques of large graphs,SIAM J. Computing 2:1?6 (March 1973).
2. A. P. Ambler, H. G. Barrow, C. M. Brown, R. M. Burstall, and R. J. Popplestone, A versatile computer controlled assembly system,Third International Joint Conference on Artifial Intelligence: Advance Papers (August 1973), pp. 298?303.
3. J. G. Augustson and J. Minker, An analysis of some graph theoretical cluster techniques,J. ACM 17: 571?588 (October 1970).
4. C. Bron and J. Kerbosch, ?Algorithm 457: Finding all cliques of an undirected graph,?Commun. ACM 16:575?577 (September 1973).
5. C. Bron, J. Kerbosch, and H. J. Schell, ?Finding Cliques in an Undirected Graph,? Technical Report, Technological University of Eindhoven, The Netherlands.
Cited by
56 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献