The Clique Algorithm
Library Home || Full Table of Contents || Suggest a Link || Library Help
|A polynomial-time algorithm for finding maximal cliques in a graph with new bounds on Ramsey numbers.|
|Math Topics:||Graph Theory|
© 1994- Drexel University. All rights reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.