On the efficiency of clique detection in graphs
This thesis examines the devices employed by various algorithms to search for maximal complete subgraphs in graphs. Also known as cliques, in Chapter 1 these subgraphs are seen to play an important role in graph theory, information retrieval, Sociometry, logic design, and computational complexity....
| Main Author: | |
|---|---|
| Language: | English |
| Published: |
University of British Columbia
2011
|
| Online Access: | http://hdl.handle.net/2429/31952 |