.

Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs

LAUR Repository

Show simple item record

dc.contributor.author Abu-Khzam, Faisal N.
dc.contributor.author Rogers, Gray L.
dc.contributor.author Perkins, Andy D.
dc.contributor.author Phillips, Charles A.
dc.contributor.author Eblen, John D.
dc.contributor.author Langston, Micheal A.
dc.date.accessioned 2017-03-20T09:07:39Z
dc.date.available 2017-03-20T09:07:39Z
dc.date.issued 2017-03-20
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 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.author.school SAS en_US
dc.author.idnumber 200302941 en_US
dc.author.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.author.email faisal.abukhzam@lau.edu.lb en_US
dc.conference.date 10 May - 13 May 2009 en_US
dc.conference.pages 374-381 en_US
dc.conference.place Rabat, Morocco en_US
dc.conference.title IEEE/ACS International Conference on Computer Systems and Applications, 2009 en_US
dc.identifier.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.author.affiliation Lebanese American University en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search LAUR


Advanced Search

Browse

My Account