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

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Rogers, G.L., Perkins, A.D., Phillips, C.A., Eblen, J.D., Abu-Khzam, F.N., Langston, M.A.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Biology computing
Broadcasting
Computational biology
Computer science
Computer vision
Concurrent computing
Distributed computing
Instruments
Mathematics
Memory management
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 381
container_issue
container_start_page 374
container_title
container_volume
creator Rogers, G.L.
Perkins, A.D.
Phillips, C.A.
Eblen, J.D.
Abu-Khzam, F.N.
Langston, M.A.
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.
doi_str_mv 10.1109/AICCSA.2009.5069351
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_5069351</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>5069351</ieee_id><sourcerecordid>5069351</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-d3f3388cf6e228e115c98240b4be9cc0d7b3c75ffa69db877c9c11b888f127793</originalsourceid><addsrcrecordid>eNo9kMluwjAYhN0FqUB5Ai5-gVAvcWwfUdQFCamHljNynN_gKolp7Ej07Qst7Vzm8M3MYRCaU7KglOiH5aos35YLRoheCFJoLugVmtCc5TlXpODXaMxoQTPBOblBMy3VH5Pi9p8xNkKT84YmhCl2h2YxfpCTcsEUz8cobKLvdjgMKQsus6EHnMDuO_85QMQp4EMf6sEChqOxCcfQDMmH7gelPeDWHH07tNg258Y5XTXQ4tCdCqmHFpov3Jh-B3jXm8M-3qORM02E2cWnaPP0-F6-ZOvX51W5XGeeSpGymjvOlbKuAMYUUCqsViwnVV6BtpbUsuJWCudMoetKSWm1pbRSSjnKpNR8iua_ux4Atofet6b_2l6O5N9jXWLH</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Rogers, G.L. ; Perkins, A.D. ; Phillips, C.A. ; Eblen, J.D. ; Abu-Khzam, F.N. ; Langston, M.A.</creator><creatorcontrib>Rogers, G.L. ; Perkins, A.D. ; Phillips, C.A. ; Eblen, J.D. ; Abu-Khzam, F.N. ; Langston, M.A.</creatorcontrib><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.</description><identifier>ISSN: 2161-5322</identifier><identifier>ISBN: 9781424438075</identifier><identifier>ISBN: 1424438071</identifier><identifier>EISSN: 2161-5330</identifier><identifier>EISBN: 1424438063</identifier><identifier>EISBN: 9781424438068</identifier><identifier>DOI: 10.1109/AICCSA.2009.5069351</identifier><identifier>LCCN: 2009900282</identifier><language>eng</language><publisher>IEEE</publisher><subject>Biology computing ; Broadcasting ; Computational biology ; Computer science ; Computer vision ; Concurrent computing ; Distributed computing ; Instruments ; Mathematics ; Memory management</subject><ispartof>2009 IEEE/ACS International Conference on Computer Systems and Applications, 2009, p.374-381</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/5069351$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/5069351$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Rogers, G.L.</creatorcontrib><creatorcontrib>Perkins, A.D.</creatorcontrib><creatorcontrib>Phillips, C.A.</creatorcontrib><creatorcontrib>Eblen, J.D.</creatorcontrib><creatorcontrib>Abu-Khzam, F.N.</creatorcontrib><creatorcontrib>Langston, M.A.</creatorcontrib><title>Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs</title><title>2009 IEEE/ACS International Conference on Computer Systems and Applications</title><addtitle>AICCSA</addtitle><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.</description><subject>Biology computing</subject><subject>Broadcasting</subject><subject>Computational biology</subject><subject>Computer science</subject><subject>Computer vision</subject><subject>Concurrent computing</subject><subject>Distributed computing</subject><subject>Instruments</subject><subject>Mathematics</subject><subject>Memory management</subject><issn>2161-5322</issn><issn>2161-5330</issn><isbn>9781424438075</isbn><isbn>1424438071</isbn><isbn>1424438063</isbn><isbn>9781424438068</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2009</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kMluwjAYhN0FqUB5Ai5-gVAvcWwfUdQFCamHljNynN_gKolp7Ej07Qst7Vzm8M3MYRCaU7KglOiH5aos35YLRoheCFJoLugVmtCc5TlXpODXaMxoQTPBOblBMy3VH5Pi9p8xNkKT84YmhCl2h2YxfpCTcsEUz8cobKLvdjgMKQsus6EHnMDuO_85QMQp4EMf6sEChqOxCcfQDMmH7gelPeDWHH07tNg258Y5XTXQ4tCdCqmHFpov3Jh-B3jXm8M-3qORM02E2cWnaPP0-F6-ZOvX51W5XGeeSpGymjvOlbKuAMYUUCqsViwnVV6BtpbUsuJWCudMoetKSWm1pbRSSjnKpNR8iua_ux4Atofet6b_2l6O5N9jXWLH</recordid><startdate>200905</startdate><enddate>200905</enddate><creator>Rogers, G.L.</creator><creator>Perkins, A.D.</creator><creator>Phillips, C.A.</creator><creator>Eblen, J.D.</creator><creator>Abu-Khzam, F.N.</creator><creator>Langston, M.A.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200905</creationdate><title>Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs</title><author>Rogers, G.L. ; Perkins, A.D. ; Phillips, C.A. ; Eblen, J.D. ; Abu-Khzam, F.N. ; Langston, M.A.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-d3f3388cf6e228e115c98240b4be9cc0d7b3c75ffa69db877c9c11b888f127793</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Biology computing</topic><topic>Broadcasting</topic><topic>Computational biology</topic><topic>Computer science</topic><topic>Computer vision</topic><topic>Concurrent computing</topic><topic>Distributed computing</topic><topic>Instruments</topic><topic>Mathematics</topic><topic>Memory management</topic><toplevel>online_resources</toplevel><creatorcontrib>Rogers, G.L.</creatorcontrib><creatorcontrib>Perkins, A.D.</creatorcontrib><creatorcontrib>Phillips, C.A.</creatorcontrib><creatorcontrib>Eblen, J.D.</creatorcontrib><creatorcontrib>Abu-Khzam, F.N.</creatorcontrib><creatorcontrib>Langston, M.A.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Rogers, G.L.</au><au>Perkins, A.D.</au><au>Phillips, C.A.</au><au>Eblen, J.D.</au><au>Abu-Khzam, F.N.</au><au>Langston, M.A.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs</atitle><btitle>2009 IEEE/ACS International Conference on Computer Systems and Applications</btitle><stitle>AICCSA</stitle><date>2009-05</date><risdate>2009</risdate><spage>374</spage><epage>381</epage><pages>374-381</pages><issn>2161-5322</issn><eissn>2161-5330</eissn><isbn>9781424438075</isbn><isbn>1424438071</isbn><eisbn>1424438063</eisbn><eisbn>9781424438068</eisbn><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.</abstract><pub>IEEE</pub><doi>10.1109/AICCSA.2009.5069351</doi><tpages>8</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2161-5322
ispartof 2009 IEEE/ACS International Conference on Computer Systems and Applications, 2009, p.374-381
issn 2161-5322
2161-5330
language eng
recordid cdi_ieee_primary_5069351
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Biology computing
Broadcasting
Computational biology
Computer science
Computer vision
Concurrent computing
Distributed computing
Instruments
Mathematics
Memory management
title Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T06%3A30%3A23IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Using%20out-of-core%20techniques%20to%20produce%20exact%20solutions%20to%20the%20maximum%20clique%20problem%20on%20extremely%20large%20graphs&rft.btitle=2009%20IEEE/ACS%20International%20Conference%20on%20Computer%20Systems%20and%20Applications&rft.au=Rogers,%20G.L.&rft.date=2009-05&rft.spage=374&rft.epage=381&rft.pages=374-381&rft.issn=2161-5322&rft.eissn=2161-5330&rft.isbn=9781424438075&rft.isbn_list=1424438071&rft_id=info:doi/10.1109/AICCSA.2009.5069351&rft_dat=%3Cieee_6IE%3E5069351%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=1424438063&rft.eisbn_list=9781424438068&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=5069351&rfr_iscdi=true