{"id":"https://openalex.org/W2024697126","doi":"https://doi.org/10.1109/icat.2011.6102096","title":"New edge sorting criterion for maximum clique search algorithm in unit disk graphs","display_name":"New edge sorting criterion for maximum clique search algorithm in unit disk graphs","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2024697126","doi":"https://doi.org/10.1109/icat.2011.6102096","mag":"2024697126"},"language":"en","primary_location":{"id":"doi:10.1109/icat.2011.6102096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icat.2011.6102096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","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/A5062977815","display_name":"B. Peruni\u010di\u0107","orcid":"https://orcid.org/0000-0001-5587-6083"},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":true,"raw_author_name":"Branislava Perunicic","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Sarajevo, Bosnia and Herzegovina","Faculty of Electrical Engineering, University of Sarajevo#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I104817121"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo#TAB#","institution_ids":["https://openalex.org/I104817121"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5004406552","display_name":"Nihad Borovina","orcid":null},"institutions":[{"id":"https://openalex.org/I104817121","display_name":"University of Sarajevo","ror":"https://ror.org/02hhwgd43","country_code":"BA","type":"education","lineage":["https://openalex.org/I104817121"]}],"countries":["BA"],"is_corresponding":false,"raw_author_name":"Nihad Borovina","raw_affiliation_strings":["Faculty of Electrical Engineering, University of Sarajevo, Bosnia and Herzegovina","Faculty of Electrical Engineering, University of Sarajevo#TAB#"],"affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo, Bosnia and Herzegovina","institution_ids":["https://openalex.org/I104817121"]},{"raw_affiliation_string":"Faculty of Electrical Engineering, University of Sarajevo#TAB#","institution_ids":["https://openalex.org/I104817121"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062977815"],"corresponding_institution_ids":["https://openalex.org/I104817121"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12420552,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9965000152587891,"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/unit-disk-graph","display_name":"Unit disk graph","score":0.7270808219909668},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6951713562011719},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6677892208099365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.639563262462616},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.610059916973114},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5390180349349976},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4985213279724121},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46159860491752625},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.431529700756073},{"id":"https://openalex.org/keywords/clique-graph","display_name":"Clique graph","score":0.4150511920452118},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4149632155895233},{"id":"https://openalex.org/keywords/wireless-network","display_name":"Wireless network","score":0.3643597960472107},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.2813342809677124},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.25718510150909424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2214038074016571},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.13533341884613037},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1266283392906189},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.08439171314239502}],"concepts":[{"id":"https://openalex.org/C130184317","wikidata":"https://www.wikidata.org/wiki/Q3115549","display_name":"Unit disk graph","level":4,"score":0.7270808219909668},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6951713562011719},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6677892208099365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.639563262462616},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.610059916973114},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5390180349349976},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4985213279724121},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46159860491752625},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.431529700756073},{"id":"https://openalex.org/C189239283","wikidata":"https://www.wikidata.org/wiki/Q17101022","display_name":"Clique graph","level":5,"score":0.4150511920452118},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4149632155895233},{"id":"https://openalex.org/C108037233","wikidata":"https://www.wikidata.org/wiki/Q11375","display_name":"Wireless network","level":3,"score":0.3643597960472107},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.2813342809677124},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25718510150909424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2214038074016571},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.13533341884613037},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1266283392906189},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.08439171314239502},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icat.2011.6102096","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icat.2011.6102096","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 XXIII International Symposium on Information, Communication and Automation Technologies","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W137822610","https://openalex.org/W1545132191","https://openalex.org/W2011039300","https://openalex.org/W2012987308","https://openalex.org/W2023875617","https://openalex.org/W2025874644","https://openalex.org/W2046112356","https://openalex.org/W2053913299","https://openalex.org/W2063572899","https://openalex.org/W2069323107","https://openalex.org/W2108455025","https://openalex.org/W2117063816","https://openalex.org/W2148694882","https://openalex.org/W2163533836","https://openalex.org/W2476096155","https://openalex.org/W4241342922","https://openalex.org/W4302441754","https://openalex.org/W6632569486","https://openalex.org/W6677240708"],"related_works":["https://openalex.org/W3121666834","https://openalex.org/W2951533720","https://openalex.org/W2794565019","https://openalex.org/W2891037262","https://openalex.org/W4300229885","https://openalex.org/W1487885374","https://openalex.org/W2162082186","https://openalex.org/W4285171291","https://openalex.org/W4224326468","https://openalex.org/W2617596428"],"abstract_inverted_index":{"Unit":[0],"disk":[1],"graphs":[2],"(UDG)":[3],"are":[4],"a":[5,17,107,133,141],"natural":[6],"choice":[7],"for":[8,42,55,93],"wireless":[9,45],"network":[10],"modeling.":[11],"However,":[12],"complex":[13],"UDG":[14,59],"algorithms":[15,138],"with":[16],"long":[18],"processing":[19,32,112],"time":[20],"could":[21],"be":[22,40],"ineffective":[23],"because":[24],"of":[25,31,34,65,72,82,110,116,144],"nodes":[26],"mobility":[27],"and":[28,87,120],"the":[29,35,66,80,91,128,148],"lack":[30],"power":[33],"nodes.":[36],"Therefore,":[37],"they":[38],"should":[39],"adapted":[41],"use":[43],"in":[44,58,85,147],"networks.":[46],"In":[47],"this":[48],"paper":[49],"we":[50],"present":[51],"an":[52,69],"accelerated":[53],"algorithm":[54,67,111],"maximum":[56],"clique":[57],"using":[60],"simple":[61],"calculations.":[62],"The":[63,96,103,124],"input":[64],"is":[68,77],"ordered":[70],"set":[71],"graph":[73],"edges.":[74],"Our":[75],"approach":[76],"to":[78,89,135,140],"decrease":[79],"number":[81],"edges":[83,92],"involved":[84],"algorithm,":[86],"then":[88],"reorder":[90],"faster":[94],"processing.":[95],"ordering":[97],"criterion":[98],"uses":[99],"two-hop":[100],"neighborhood":[101],"information.":[102],"simulation":[104],"results":[105,125],"show":[106],"significant":[108],"shortening":[109],"time.":[113],"Two":[114],"types":[115],"node":[117,145],"distribution,":[118],"x-y":[119],"p-\u03c6":[121],"were":[122],"tested.":[123],"depend":[126],"on":[127],"distribution":[129,146],"type.":[130],"This":[131],"indicates":[132],"possibility":[134],"create":[136],"adaptive":[137],"fitted":[139],"specific":[142],"type":[143],"network.":[149]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}