An enumerative algorithm for the maximum clique problem
Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. Search results for efficient implementation of any graph for randomly generated graphs of up to 10 vertices and more than ten sides. Appropriate specifications are also provided for testing p...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2019
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/1867/1/FH03-FIK-20-37014.pdf http://eprints.unisza.edu.my/1867/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|