{"id":"https://openalex.org/W2171744456","doi":"https://doi.org/10.1109/hpcsim.2011.5999818","title":"Determining the maximum clique size in large random geometric graphs","display_name":"Determining the maximum clique size in large random geometric graphs","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2171744456","doi":"https://doi.org/10.1109/hpcsim.2011.5999818","mag":"2171744456"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2011.5999818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing &amp; Simulation","raw_type":"proceedings-article"},"type":"article","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/A5074120443","display_name":"Ilteris Murat Derici","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ilteris Murat Derici","raw_affiliation_strings":["Bobby B. Lyle School of Engineering, Computer Science and Engineering Department, Southern Methodist University, Dallas, TX, USA"],"affiliations":[{"raw_affiliation_string":"Bobby B. Lyle School of Engineering, Computer Science and Engineering Department, Southern Methodist University, Dallas, TX, USA","institution_ids":["https://openalex.org/I178169726"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004426373","display_name":"Mihai T. Panu","orcid":null},"institutions":[{"id":"https://openalex.org/I178169726","display_name":"Southern Methodist University","ror":"https://ror.org/042tdr378","country_code":"US","type":"education","lineage":["https://openalex.org/I178169726"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihai Tudor Panu","raw_affiliation_strings":["Bobby B. Lyle School of Engineering, Computer Science and Engineering Department, Southern Methodist University, Dallas, TX, USA"],"affiliations":[{"raw_affiliation_string":"Bobby B. Lyle School of Engineering, Computer Science and Engineering Department, Southern Methodist University, Dallas, TX, USA","institution_ids":["https://openalex.org/I178169726"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5074120443"],"corresponding_institution_ids":["https://openalex.org/I178169726"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.18144204,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"10","issue":null,"first_page":"143","last_page":"154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":1.0,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7366276979446411},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5360007882118225},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5331190228462219},{"id":"https://openalex.org/keywords/random-graph","display_name":"Random graph","score":0.5310664176940918},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5059368014335632},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4840823709964752},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.47824469208717346},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.4373428225517273},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.34369295835494995},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3203551769256592},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.29356348514556885},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.1259191632270813}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7366276979446411},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5360007882118225},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5331190228462219},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.5310664176940918},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5059368014335632},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4840823709964752},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.47824469208717346},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.4373428225517273},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.34369295835494995},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3203551769256592},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.29356348514556885},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.1259191632270813},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2011.5999818","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2011.5999818","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference on High Performance Computing &amp; Simulation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W11053693","https://openalex.org/W630423399","https://openalex.org/W1493177640","https://openalex.org/W1532544102","https://openalex.org/W1656617460","https://openalex.org/W1979412257","https://openalex.org/W2002531683","https://openalex.org/W2006632549","https://openalex.org/W2033554386","https://openalex.org/W2056979696","https://openalex.org/W2063572899","https://openalex.org/W2080228825","https://openalex.org/W2089417393","https://openalex.org/W2094122556","https://openalex.org/W2094224753","https://openalex.org/W2109164986","https://openalex.org/W2116007667","https://openalex.org/W2149342630","https://openalex.org/W2152216760","https://openalex.org/W2157529519","https://openalex.org/W2162752950","https://openalex.org/W2294980849","https://openalex.org/W2435603672","https://openalex.org/W2480020364","https://openalex.org/W2732059893","https://openalex.org/W2797618585","https://openalex.org/W2799004609","https://openalex.org/W4213060883","https://openalex.org/W4243641201","https://openalex.org/W4244027514","https://openalex.org/W6600474004"],"related_works":["https://openalex.org/W2949617446","https://openalex.org/W4294299870","https://openalex.org/W2748664888","https://openalex.org/W1582492864","https://openalex.org/W35387897","https://openalex.org/W2591659253","https://openalex.org/W2745231626","https://openalex.org/W2151690061","https://openalex.org/W2949558109","https://openalex.org/W4302509247"],"abstract_inverted_index":{"For":[0],"a":[1,5,103],"geometric":[2,51,67,104],"graph":[3],"on":[4,28,73],"topology,":[6],"we":[7],"employ":[8],"an":[9],"iterated":[10],"version":[11],"of":[12,58,83,102],"the":[13,21,50,56,70,74,84,100],"smallest":[14],"last":[15],"coloring":[16],"algorithm":[17,85],"to":[18],"obtain":[19],"either":[20],"largest":[22],"clique":[23],"or":[24],"very":[25],"tight":[26],"bounds":[27],"its":[29],"size.":[30],"The":[31,80],"procedure":[32],"is":[33,86],"topology":[34],"independent":[35],"and":[36,42,53,72,76,97,108],"runs":[37],"in":[38,48,54,69],"two":[39],"phases,":[40],"global":[41],"local.":[43],"We":[44,61],"exploit":[45],"pruning":[46],"methods":[47],"building":[49],"graphs":[52,68],"limiting":[55],"number":[57],"sub-graphs":[59],"searched.":[60],"have":[62],"performed":[63],"experiments":[64],"using":[65],"random":[66],"plane":[71],"sphere,":[75],"provide":[77],"computational":[78],"results.":[79],"time":[81],"complexity":[82],"O(|E|":[87],"\u00d7|V|":[88],"+":[89],"|V|":[90,98],"<sup":[91],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[92],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[93],")":[94],"where":[95],"|E|":[96],"are":[99],"cardinalities":[101],"graph's":[105],"edge":[106],"set":[107],"vertex":[109],"set,":[110],"respectively.":[111]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}