A Parallel Algorithm that Enumerates all the Cliques in an Undirected Graph
Publisher
Springer Netherlands
Reference12 articles.
1. Brayton, R. K., Hachtel, G. D., Sangiovanni- Vincentelli, A. L., Multilevel Logic Synthesis, Proc. IEEE, Vol. 78, No. 2, February 1990, pp.264-300. 2. Balas, E., Yu, C. S., Finding a Maximal clique in an Arbitrary Graph, SIAM J. Computing 15(4), 1986, pp.1054-1068. 3. Biggs, N., Some Heuristics for Graph Coloring, in : R. Nelson and R. J. Wilson, eds, Graph Colourings, Longman, New York, 1990. 4. Bron, C., Kerbosch, J., Finding all Cliques of an Undirected Graph, Comm. ACM 16(9), 1973, pp. 575-577. 5. Carraghan, R., Pardalos, P. M., An Exact Algorithm for the Maximum Clique Problem, Operational Research Letters. 9, 1990, pp.375-382.
|
|