Find graph clique algorithm
Users: 1 - Average Rating: 5.00
The algorithm has the following main features:
• It finds clique of a given graph
• Directed and undirected graphs are covered
• Linked to performance evaluation via related benchmark
• It finds clique of a given graph
• Directed and undirected graphs are covered
• Linked to performance evaluation via related benchmark
Language/Environments:
Optimization
Target Group:
Basic
Author of the review:
Andrej Košir
University of Ljubljana
You have to login to leave a comment. If you are not registered click here
Eligius Hendrix