Determining Cliques of a Graph
| dc.contributor.author | Johnson, Leroy, F. | |
| dc.date.accessioned | 2023-03-01T18:27:05Z | |
| dc.date.available | 2023-03-01T18:27:05Z | |
| dc.date.issued | 1975 | |
| dc.description.abstract | A generalization of the neighborhood of a vertex [7] is used to prove several results on the relation of a set of vertices of a graph to cliques of that graph. These results lead to an efficient adaptive algorithm for enumerating the cliques of a graph. The storage requirement of the algorithm is of order O(n2). | |
| dc.description.copyright | Copyright @ LeRoy F. Johnson, 1975. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14691 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | Determining Cliques of a Graph | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1