{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T21:13:42Z","timestamp":1784236422902,"version":"3.55.0"},"reference-count":251,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,4,1]],"date-time":"2020-04-01T00:00:00Z","timestamp":1585699200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. IEEE"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1109\/jproc.2020.2977595","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T02:18:32Z","timestamp":1585016312000},"page":"583-608","source":"Crossref","is-referenced-by-count":24,"title":["A Tutorial on Clique Problems in Communications and Signal Processing"],"prefix":"10.1109","volume":"108","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7791-9443","authenticated-orcid":false,"given":"Ahmed","family":"Douik","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0737-6372","authenticated-orcid":false,"given":"Hayssam","family":"Dahrouj","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Effat University, Jeddah, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6955-4720","authenticated-orcid":false,"given":"Tareq Y.","family":"Al-Naffouri","sequence":"additional","affiliation":[{"name":"Division of Computer, Electrical and Mathematical Sciences, and Engineering Ahmed Douik, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4827-1793","authenticated-orcid":false,"given":"Mohamed-Slim","family":"Alouini","sequence":"additional","affiliation":[{"name":"Division of Computer, Electrical and Mathematical Sciences, and Engineering Ahmed Douik, King Abdullah University of Science and Technology, Thuwal, Saudi Arabia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref170","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref172","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.2328098"},{"key":"ref171","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.73"},{"key":"ref174","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807213"},{"key":"ref173","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2015.7263349"},{"key":"ref176","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2518182"},{"key":"ref175","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2606596"},{"key":"ref178","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2521374"},{"key":"ref177","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2816597"},{"key":"ref168","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2237945"},{"key":"ref169","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2003.1193972"},{"key":"ref39","author":"harley","year":"2003","journal-title":"Graph Algorithms for Assembling Integrated Genome Maps"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.6.487"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/BF02277184"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248731"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF00991836"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/0202001"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44634-6_42"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00286-3"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90065-8"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(83)90115-3"},{"key":"ref181","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2018.2840723"},{"key":"ref180","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2017.2778105"},{"key":"ref185","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2010.5506109"},{"key":"ref184","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2011.120810.090280"},{"key":"ref183","author":"medard","year":"2012","journal-title":"Network Coding Fundamentals and Applications Amsterdam The Netherlands"},{"key":"ref182","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"ref189","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544612"},{"key":"ref188","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595303"},{"key":"ref187","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313060"},{"key":"ref186","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874540"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/0214017"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0209042"},{"key":"ref179","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2017.2779485"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02760024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.11.010"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1038\/nature02053"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-48540-7_13"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF00985661"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/321607.321608"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/0206036"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/0126009"},{"key":"ref50","author":"ausiello","year":"2012","journal-title":"Complexity and Approximation Combinatorial Optimization Problems and Their Approximability Properties"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/0206038"},{"key":"ref154","first-page":"623","article-title":"Performance comparison of evolutionary algorithms for university course timetabling problem","volume":"20","author":"maya","year":"2016","journal-title":"Computación y Sistemas"},{"key":"ref153","doi-asserted-by":"publisher","DOI":"10.1016\/j.chemolab.2015.08.020"},{"key":"ref156","doi-asserted-by":"publisher","DOI":"10.1109\/MCSI.2015.54"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1109\/43.35554"},{"key":"ref150","author":"kennedy","year":"2001","journal-title":"Swarm Intelligence"},{"key":"ref152","doi-asserted-by":"publisher","DOI":"10.1109\/MED.2007.4433821"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.1997.637339"},{"key":"ref146","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2013.6557756"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2013.08.009"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2014.04.011"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2012.02.011"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2008.10.014"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/BF01098364"},{"key":"ref56","first-page":"317","article-title":"A new exact algorithm for the maximum-weight clique problem","author":"yamaguchi","year":"2008","journal-title":"Proc 23rd Int Tech Conf Circuits\/Syst Comput Commun (ITC-CSCC)"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13731-0_7"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1552285.1552286"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90032-5"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676847"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00064"},{"key":"ref167","doi-asserted-by":"publisher","DOI":"10.37236\/407"},{"key":"ref166","doi-asserted-by":"publisher","DOI":"10.1007\/s10801-009-0191-2"},{"key":"ref165","first-page":"37","article-title":"Combinatorial optimization algorithms for the design of codes: A survey","volume":"7","author":"montemanni","year":"2015","journal-title":"Int J Appl Oper Res"},{"key":"ref164","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1677-0_6"},{"key":"ref163","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1982.1269996"},{"key":"ref162","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87477-5_39"},{"key":"ref161","doi-asserted-by":"publisher","DOI":"10.1109\/CSIE.2009.690"},{"key":"ref160","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00082"},{"key":"ref4","author":"gould","year":"2012","journal-title":"Graph Theory"},{"key":"ref3","volume":"2","author":"west","year":"2001","journal-title":"Introduction to Graph Theory"},{"key":"ref6","author":"diestel","year":"2000","journal-title":"Graph Theory"},{"key":"ref5","volume":"184","author":"bollob\u00e1s","year":"2013","journal-title":"Modern Graph Theory"},{"key":"ref8","author":"vasudev","year":"2006","journal-title":"Graph Theory with Applications"},{"key":"ref159","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2016.7565067"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/4918"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-79711-3"},{"key":"ref157","doi-asserted-by":"publisher","DOI":"10.1109\/VTCFall.2014.6966079"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.56"},{"key":"ref158","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2018.2797085"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27810-8_23"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/17.12.1198"},{"key":"ref48","volume":"29","author":"garey","year":"2002","journal-title":"Computers and Intractability"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.06.015"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27798-9_19"},{"key":"ref44","first-page":"1","article-title":"Finding all cliques of an undirected graph","author":"regneri","year":"2007","journal-title":"Proc Seminar Current Trends IE WS"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/11811305_67"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/72.883403"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-3279-4_18"},{"key":"ref71","article-title":"A parallel algorithm for maximum weight clique problem","author":"carraghan","year":"1990"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1109\/INDICON.2017.8488050"},{"key":"ref76","first-page":"2623","article-title":"Tailoring local search for partial MaxSAT","author":"cai","year":"2014","journal-title":"Proc AAAI"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/ICEMI.2017.8265823"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.229"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/MCSoC2018.2018.00043"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/CoDIT.2018.8394892"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00060"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415983"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/ICIS.2013.6607889"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ISCO.2014.7103958"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848102"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/DMO.2009.5341909"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2015.2433294"},{"key":"ref66","first-page":"119","article-title":"On maximum clique problems in very large graphs","volume":"50","author":"pardalos","year":"1999","journal-title":"DIMACS Ser"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/1597036.1597042"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137660"},{"key":"ref197","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2735959"},{"key":"ref198","first-page":"3150","article-title":"Clique, independent set, and graph coloring","volume":"8","author":"pattillo","year":"2011","journal-title":"Encyclopedia Oper Res Management Science"},{"key":"ref199","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2017.2779485"},{"key":"ref193","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620405"},{"key":"ref194","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283853"},{"key":"ref195","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283851"},{"key":"ref196","first-page":"1","article-title":"Index coding and local partial clique covers","author":"agarwal","year":"2016","journal-title":"Proc Int Conf Signal Process Commun (SPCOM)"},{"key":"ref95","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.668546"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2867817"},{"key":"ref190","article-title":"Index coding via linear programming","volume":"abs 1004 1379","author":"blasiak","year":"2010","journal-title":"ArXiv e-prints"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1145\/2333112.2333118"},{"key":"ref191","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283912"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22450-8_27"},{"key":"ref192","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.35"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2017.00016"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.Congress.2014.31"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-73198-8_20"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.12.007"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2002.804320"},{"key":"ref81","author":"kaye","year":"2007","journal-title":"An Introduction to Quantum Computing"},{"key":"ref84","first-page":"21","article-title":"Quantum-inspired evolutionary algorithm to solve graph coloring problem","author":"das","year":"2014","journal-title":"Proc Intl Conf Adv Comput Electron Electr Technol (CEET)"},{"key":"ref83","first-page":"202","article-title":"An effective quantum-inspired evolutionary algorithm for finding degree-constrained minimum spanning tree","volume":"2","author":"das","year":"2014","journal-title":"Int J Comput Sci Electron Eng"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1049\/cce:19990303"},{"key":"ref89","first-page":"74","article-title":"Scalable maximum clique computation using MapReduce","author":"xiang","year":"2013","journal-title":"Proc IEEE 29th Int Conf Data Eng (ICDE)"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1109\/ICEEICT.2015.7307535"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477865"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1109\/BICTA.2009.5338147"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90072-U"},{"key":"ref200","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2018.8450715"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2016.08.017"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1109\/DSAA.2015.7344810"},{"key":"ref209","article-title":"A game-theoretic framework for decentralized cooperative data exchange using network coding","author":"douik","year":"0","journal-title":"IEEE Trans Mobile Comput"},{"key":"ref203","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2015.2424054"},{"key":"ref204","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2015.7414149"},{"key":"ref201","doi-asserted-by":"publisher","DOI":"10.1109\/CC.2018.8424578"},{"key":"ref202","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2018.2881123"},{"key":"ref207","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037034"},{"key":"ref208","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2014.7037599"},{"key":"ref205","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2018.2865545"},{"key":"ref206","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2445338"},{"key":"ref211","doi-asserted-by":"publisher","DOI":"10.1109\/NETCOD.2015.7176779"},{"key":"ref210","doi-asserted-by":"publisher","DOI":"10.1109\/WiMOB.2013.6673389"},{"key":"ref212","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2665587"},{"key":"ref213","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2010.5683677"},{"key":"ref214","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2014.022814.140067"},{"key":"ref215","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2016.2585381"},{"key":"ref216","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2635638"},{"key":"ref217","doi-asserted-by":"publisher","DOI":"10.1186\/s13634-015-0293-z"},{"key":"ref218","doi-asserted-by":"publisher","DOI":"10.1002\/9780470665121"},{"key":"ref219","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2007.909778"},{"key":"ref220","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM.2003.1192765"},{"key":"ref222","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.33"},{"key":"ref221","doi-asserted-by":"publisher","DOI":"10.1109\/ICEEE.2005.1529560"},{"key":"ref229","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1100.0851"},{"key":"ref228","doi-asserted-by":"publisher","DOI":"10.1109\/PDCAT.2017.00059"},{"key":"ref227","doi-asserted-by":"publisher","DOI":"10.1109\/ATEE.2017.7905125"},{"key":"ref226","doi-asserted-by":"publisher","DOI":"10.1109\/ICASI.2017.7988169"},{"key":"ref225","doi-asserted-by":"publisher","DOI":"10.1109\/ICSSE.2017.8030935"},{"key":"ref224","doi-asserted-by":"publisher","DOI":"10.1109\/ICSSE.2017.8030934"},{"key":"ref223","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2015.2498616"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(00)00100-4"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_33"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/937503.937505"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-008-9098-4"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-008-0089-1"},{"key":"ref128","first-page":"433","article-title":"An introduction to variable neighborhood search","author":"hansen","year":"1999","journal-title":"Meta-Heuristics"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1111\/j.1475-3995.2005.498_1.x"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1007\/s10288-011-0153-0"},{"key":"ref134","volume":"57","author":"glover","year":"2006","journal-title":"Handbook of Metaheuristics"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.1007\/BF01096763"},{"key":"ref232","doi-asserted-by":"publisher","DOI":"10.1109\/ICICCT.2018.8473246"},{"key":"ref233","doi-asserted-by":"publisher","DOI":"10.1109\/CCSSE.2017.8088014"},{"key":"ref230","first-page":"43","article-title":"Mapping networks of terrorist cells","volume":"24","author":"krebs","year":"2002","journal-title":"Connections"},{"key":"ref231","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.80.056117"},{"key":"ref239","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.052313.121128"},{"key":"ref238","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2015.7143328"},{"key":"ref235","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2013.6732487"},{"key":"ref234","doi-asserted-by":"publisher","DOI":"10.1109\/ICTS.2016.7910269"},{"key":"ref237","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"ref236","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1002\/0471739383"},{"key":"ref135","doi-asserted-by":"crossref","DOI":"10.1002\/9780470496916","volume":"74","author":"talbi","year":"2009","journal-title":"Metaheuristics From Design to Implementation"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/2.294849"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(86)90058-2"},{"key":"ref139","first-page":"141","article-title":"A survey of parallel genetic algorithms","volume":"10","author":"cant\u00fa-paz","year":"1998","journal-title":"Calculateurs Paralleles Reseaux et Systems Repartis"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1109\/ICGTSPICC.2016.7955308"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1016\/B978-008045157-2\/50081-X"},{"key":"ref142","first-page":"1","article-title":"The bees algorithm technical note","author":"pham","year":"2005","journal-title":"Manufactnring Engineering Centre"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.3390\/computers6010005"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-8971-2_2"},{"key":"ref144","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-013-1104-9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/017284a0"},{"key":"ref145","doi-asserted-by":"publisher","DOI":"10.1080\/23311916.2015.1091540"},{"key":"ref241","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2015.7417578"},{"key":"ref242","first-page":"1962","article-title":"Sparse beamforming for limited-backhaul network MIMO system via reweighted power minimization","author":"dai","year":"2013","journal-title":"Proc IEEE Global Commun Conf (GLOBECOM)"},{"key":"ref243","doi-asserted-by":"crossref","first-page":"2809","DOI":"10.1109\/TWC.2014.040214.131770","article-title":"Group sparse beamforming for green cloud-RAN","volume":"13","author":"shi","year":"2014","journal-title":"IEEE Trans Wireless Commun"},{"key":"ref244","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2280111"},{"key":"ref240","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062043"},{"key":"ref248","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2017.2728009"},{"key":"ref247","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2749573"},{"key":"ref246","first-page":"1","article-title":"Coordinated scheduling for wireless backhaul networks with soft frequency reuse","author":"dahrouj","year":"2013","journal-title":"Proc 21st Eur Signal Process Conf (EUSIPCO)"},{"key":"ref245","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2015.7248768"},{"key":"ref249","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2504524"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2016.7511143"},{"key":"ref108","first-page":"871","article-title":"The Laplacian spectrum of graphs","author":"mohar","year":"1991","journal-title":"Graph Theory Combinatorics and Applications"},{"key":"ref107","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.017"},{"key":"ref106","first-page":"23:1","article-title":"On maximal cliques with connectivity constraints in directed graphs","volume":"92","author":"conte","year":"2017","journal-title":"Leibniz International Proceedings in Informatics"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1016\/0771-050X(75)90035-2"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.1109\/ICAICT.2014.7035970"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2018.5158"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.3390\/a10010001"},{"key":"ref111","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462107"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2016.2557789"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2015.7306543"},{"key":"ref250","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2009.080649"},{"key":"ref251","volume":"3","author":"stanczak","year":"2009","journal-title":"Fundamentals of Resource Allocation in Wireless Networks Theory and Algorithms"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CONTROL.2012.6334718"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICECDS.2017.8389737"},{"key":"ref12","first-page":"300","author":"cannataro","year":"2012","journal-title":"Graph Theory and Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/BIBE.2007.4375569"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SSST.2001.918502"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CICSyN.2011.40"},{"key":"ref16","author":"chung","year":"1997","journal-title":"Spectral Graph Theory"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1137\/1033004"},{"key":"ref17","first-page":"155","article-title":"On the history of the shortest path problem","volume":"17","author":"schrijver","year":"2012","journal-title":"Doc Math"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(92)90067-F"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289146"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0086-0"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/ICCW.2015.7247067"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00348-1"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580444"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.972"},{"key":"ref122","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(90)90057-C"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00290-6"}],"container-title":["Proceedings of the IEEE"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5\/9063691\/09044331.pdf?arnumber=9044331","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,29]],"date-time":"2023-09-29T00:47:26Z","timestamp":1695948446000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9044331\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4]]},"references-count":251,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jproc.2020.2977595","relation":{},"ISSN":["0018-9219","1558-2256"],"issn-type":[{"value":"0018-9219","type":"print"},{"value":"1558-2256","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4]]}}}