Publication | Open Access
Algorithm 457: finding all cliques of an undirected graph
2.4K
Citations
6
References
1973
Year
bttroductian. A maximal complete subgraph (clique) is a complete subgraph that is not contained in any other complete subgraph.
| Year | Citations | |
|---|---|---|
Page 1
Page 1