Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs
Practical methods are presented for computing exact solutions to the maximum clique problem on graphs that are too large to fit within core memory. These methods use a combination of in-core and out-of-core techniques, recursively dissecting large graphs into manageable components. A global solution...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5402 http://dx.doi.org/10.1109/AICCSA.2009.5069351 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/5069351/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Practical methods are presented for computing exact solutions to the maximum clique problem on graphs that are too large to fit within core memory. These methods use a combination of in-core and out-of-core techniques, recursively dissecting large graphs into manageable components. A global solution to the maximum clique problem is derived from local solutions generated for each of the individual components. Parallelizing the search within these components is instrumental in improving the running times of the algorithms. |
|---|