- LAUR Home
- →
- School of Arts and Sciences
- →
- SoAS - Scholarly Publications
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.coverage.spatial | Rabat, Morocco | en_US |
| dc.creator | Abu-Khzam, Faisal N. | en_US |
| dc.creator | Rogers, Gray L. | en_US |
| dc.creator | Perkins, Andy D. | en_US |
| dc.creator | Phillips, Charles A. | en_US |
| dc.creator | Eblen, John D. | en_US |
| dc.creator | Langston, Micheal A. | en_US |
| dc.date.accessioned | 2017-03-20T09:07:39Z | |
| dc.date.available | 2017-03-20T09:07:39Z | |
| dc.identifier.uri | http://hdl.handle.net/10725/5402 | |
| dc.description.abstract | 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. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | IEEE | en_US |
| dc.title | IEEE/ACS International Conference on Computer Systems and Applications, 2009 | en_US |
| dc.title | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs | en_US |
| dc.type | Conference Paper / Proceeding | en_US |
| dc.creator.school | SAS | en_US |
| dc.creator.identifier | 200302941 | en_US |
| dc.creator.department | Computer Science and Mathematics | en_US |
| dc.description.embargo | N/A | en_US |
| dc.keywords | Computer science | en_US |
| dc.keywords | Mathematics | en_US |
| dc.keywords | Instruments | en_US |
| dc.keywords | Computer vision | en_US |
| dc.keywords | Computational biology | en_US |
| dc.keywords | Biology computing | en_US |
| dc.keywords | Concurrent computing | en_US |
| dc.keywords | Distributed computing | en_US |
| dc.keywords | Memory management | en_US |
| dc.keywords | Broadcasting | en_US |
| dc.identifier.doi | http://dx.doi.org/10.1109/AICCSA.2009.5069351 | en_US |
| dc.identifier.ctation | Rogers, G. L., Perkins, A. D., Phillips, C. A., Eblen, J. D., Abu-Khzam, F. N., & Langston, M. A. (2009, May). Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. In Computer Systems and Applications, 2009. AICCSA 2009. IEEE/ACS International Conference on (pp. 374-381). IEEE. | en_US |
| dc.creator.email | faisal.abukhzam@lau.edu.lb | en_US |
| dc.date.created | 10 May - 13 May 2009 | en_US |
| dc.description.pages | 374-381 | en_US |
| dc.description.tou | http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php | en_US |
| dc.identifier.url | http://ieeexplore.ieee.org/abstract/document/5069351/ | en_US |
| dc.creator.ispartof | Lebanese American University | en_US |
