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...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , , , |
| التنسيق: | conferenceObject |
| منشور في: |
2017
|
| الوصول للمادة أونلاين: | 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/ |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513476278353920 |
|---|---|
| author | Abu-Khzam, Faisal N. |
| author2 | Rogers, Gray L. Perkins, Andy D. Phillips, Charles A. Eblen, John D. Langston, Micheal A. |
| author2_role | author author author author author |
| author_facet | Abu-Khzam, Faisal N. Rogers, Gray L. Perkins, Andy D. Phillips, Charles A. Eblen, John D. Langston, Micheal A. |
| author_role | author |
| dc.creator.none.fl_str_mv | Abu-Khzam, Faisal N. Rogers, Gray L. Perkins, Andy D. Phillips, Charles A. Eblen, John D. Langston, Micheal A. |
| dc.date.none.fl_str_mv | 2017-03-20T09:07:39Z 2017-03-20T09:07:39Z 2017-03-20 |
| dc.identifier.none.fl_str_mv | http://hdl.handle.net/10725/5402 http://dx.doi.org/10.1109/AICCSA.2009.5069351 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. http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/5069351/ |
| dc.language.none.fl_str_mv | en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.title.none.fl_str_mv | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| dc.type.none.fl_str_mv | Conference Paper / Proceeding info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/conferenceObject |
| description | 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. |
| eu_rights_str_mv | openAccess |
| format | conferenceObject |
| id | LAURepo_f1647deadb3a36f14e956808871abfdd |
| identifier_str_mv | 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. |
| language_invalid_str_mv | en |
| network_acronym_str | LAURepo |
| network_name_str | Lebanese American University repository |
| oai_identifier_str | oai:laur.lau.edu.lb:10725/5402 |
| publishDate | 2017 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphsAbu-Khzam, Faisal N.Rogers, Gray L.Perkins, Andy D.Phillips, Charles A.Eblen, John D.Langston, Micheal A.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.N/AIEEE2017-03-20T09:07:39Z2017-03-20T09:07:39Z2017-03-20Conference Paper / Proceedinginfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjecthttp://hdl.handle.net/10725/5402http://dx.doi.org/10.1109/AICCSA.2009.5069351Rogers, 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.http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.phphttp://ieeexplore.ieee.org/abstract/document/5069351/eninfo:eu-repo/semantics/openAccessoai:laur.lau.edu.lb:10725/54022021-03-19T10:00:51Z |
| spellingShingle | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs Abu-Khzam, Faisal N. |
| status_str | publishedVersion |
| title | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| title_full | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| title_fullStr | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| title_full_unstemmed | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| title_short | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| title_sort | Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs |
| url | 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/ |