A clique-detection algorithm based on neighborhoods in graphs

DOI10.1007/BF00985661zbMath0271.68066OpenAlexW2078689746MaRDI QIDQ3214447

Julius T. Tou, R. E. Osteen

Publication date: 1973

Published in: International Journal of Computer & Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00985661

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Algorithms in computer science (68W99)

Related Items (3)

A linear time algorithm for maximal clique enumeration in large sparse graphs ⋮ Cliques of a graph-variations on the Bron-Kerbosch algorithm ⋮ The maximum clique problem

Cites Work

• Unnamed Item
• The Construction of Hierarchic and Non-Hierarchic Classifications
• An Analysis of Some Graph Theoretical Cluster Techniques
• On Some Clustering Techniques
• On cliques in graphs

This page was built for publication: A clique-detection algorithm based on neighborhoods in graphs