{"id":"https://openalex.org/W106934005","doi":"https://doi.org/10.1090/dimacs/050/06","title":"On maximum clique problems in very large graphs","display_name":"On maximum clique problems in very large graphs","publication_year":1999,"publication_date":"1999-11-30","ids":{"openalex":"https://openalex.org/W106934005","doi":"https://doi.org/10.1090/dimacs/050/06","mag":"106934005"},"language":"en","primary_location":{"id":"doi:10.1090/dimacs/050/06","doi":"https://doi.org/10.1090/dimacs/050/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/050/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W2175777942","display_name":"External Memory Algorithms"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085053856","display_name":"James M. Abello","orcid":"https://orcid.org/0000-0002-9614-0467","observed_orcids":["https://orcid.org/0000-0002-9614-0467"]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Abello","raw_affiliation_strings":["AT&T Labs-Research, Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs-Research, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063808461","display_name":"P\u00e3nos M. Pardalos","orcid":"https://orcid.org/0000-0003-2824-101X","observed_orcids":["https://orcid.org/0000-0003-2824-101X"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Panos Pardalos","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"M. Resende","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I1283103587","display_name":"AT&T (United States)","ror":"https://ror.org/02bbd5539","country_code":"US","type":"company","lineage":["https://openalex.org/I1283103587"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Resende","raw_affiliation_strings":["AT&T Labs-Research, Florham Park, NJ"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AT&T Labs-Research, Florham Park, NJ","institution_ids":["https://openalex.org/I1283103587"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.4611,"has_fulltext":false,"cited_by_count":223,"citation_normalized_percentile":{"value":0.97650131,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"119","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9175000190734863,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9175000190734863,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.05790000036358833,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10064","display_name":"Complex Network Analysis Techniques","score":0.010499999858438969,"subfield":{"id":"https://openalex.org/subfields/3109","display_name":"Statistical and Nonlinear Physics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-clique-problem","display_name":"maximum clique problem","score":0.9980000257492065},{"id":"https://openalex.org/keywords/graph-decomposition","display_name":"graph decomposition","score":0.8489999771118164},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"greedy randomized adaptive search procedure","score":0.9670000076293945},{"id":"https://openalex.org/keywords/approximate-solutions","display_name":"approximate solutions","score":0.6539999842643738},{"id":"https://openalex.org/keywords/sparse-graphs","display_name":"sparse graphs","score":0.9670000076293945},{"id":"https://openalex.org/keywords/telecommunications-networks","display_name":"telecommunications networks","score":0.6579999923706055},{"id":"https://openalex.org/keywords/graph-structure-analysis","display_name":"graph structure analysis","score":0.6349999904632568}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.817690372467041},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4596061706542969},{"id":"https://openalex.org/C186942658","wikidata":"https://www.wikidata.org/wiki/Q5134410","display_name":"Clique-sum","level":5,"score":0.4418693780899048},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39644190669059753},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3783707022666931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37475383281707764},{"id":"https://openalex.org/C160446614","wikidata":"https://www.wikidata.org/wiki/Q1322892","display_name":"Chordal graph","level":3,"score":0.26607745885849},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13990214467048645},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.0972939133644104}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1090/dimacs/050/06","doi":"https://doi.org/10.1090/dimacs/050/06","is_oa":false,"landing_page_url":"https://doi.org/10.1090/dimacs/050/06","pdf_url":null,"source":{"id":"https://openalex.org/S4210177973","display_name":"DIMACS series in discrete mathematics and theoretical computer science","issn_l":"1052-1798","issn":["1052-1798","2472-4793"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.17.5786","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.17.5786","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.research.att.com/resources/trs/./TRs/98/98.32/98.32.1.body.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"id":"https://metadata.un.org/sdg/13","display_name":"Climate action","score":0.49000000953674316}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1497256448","https://openalex.org/W1510300750","https://openalex.org/W1976713424","https://openalex.org/W1998882407","https://openalex.org/W2001564241","https://openalex.org/W2024060531","https://openalex.org/W2028438572","https://openalex.org/W2040579873","https://openalex.org/W2082603400","https://openalex.org/W2090275183","https://openalex.org/W2104670598","https://openalex.org/W2117942072","https://openalex.org/W2339500526"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2165678151","https://openalex.org/W1796509207","https://openalex.org/W2082603400","https://openalex.org/W3203939381","https://openalex.org/W2005991213","https://openalex.org/W2162082186","https://openalex.org/W4205516090","https://openalex.org/W4287909982","https://openalex.org/W106934005"],"abstract_inverted_index":{".":[0],"We":[1,14,59],"present":[2],"an":[3],"approach":[4],"for":[5,39,142],"clique":[6,46],"and":[7,48,83,145],"quasi-clique":[8],"computations":[9],"in":[10,52,69],"very":[11,53,111],"large":[12,54,112],"multi-digraphs.":[13],"discuss":[15],"graph":[16],"decomposition":[17],"schemes":[18],"used":[19],"to":[20,43],"break":[21],"up":[22],"the":[23,44,70,77,127,133,136],"problem":[24,47,51],"into":[25],"several":[26],"pieces":[27],"of":[28,79,81,89,98,103,119,126,135],"manageable":[29],"dimensions.":[30],"A":[31],"semiexternal":[32],"greedy":[33],"randomized":[34],"adaptive":[35],"search":[36],"procedure":[37],"(GRASP)":[38],"finding":[40],"approximate":[41],"solutions":[42],"maximum":[45,49],"quasiclique":[50],"sparse":[55],"graphs":[56,74],"is":[57,140],"presented.":[58],"experiment":[60],"with":[61,94,115],"this":[62],"heuristic":[63],"on":[64,76],"real":[65],"data":[66,91,105],"sets":[67,92,106],"collected":[68],"telecommunications":[71],"industry.":[72],"These":[73],"contain":[75],"order":[78],"millions":[80],"vertices":[82],"edges.":[84],"1.":[85],"Introduction":[86],"The":[87],"proliferation":[88],"massive":[90],"brings":[93],"it":[95],"a":[96,116],"series":[97],"special":[99,117,124],"computational":[100],"challenges.":[101],"Many":[102],"these":[104],"can":[107],"be":[108],"modeled":[109],"as":[110],"multidigraphs":[113],"M":[114],"set":[118],"edge":[120],"attributes":[121],"that":[122],"represent":[123],"characteristics":[125],"application":[128],"at":[129],"hand":[130],"[1].":[131],"Understanding":[132],"structure":[134],"underlying":[137],"digraph":[138],"D(M)":[139],"essential":[141],"storage":[143],"organization":[144],"information":[146],"retrieval...":[147]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":12},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":9}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2025-10-10T00:00:00"}