{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T13:22:11Z","timestamp":1719926531897},"reference-count":54,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Network and Computer Applications"],"published-print":{"date-parts":[[2016,11]]},"DOI":"10.1016\/j.jnca.2016.09.003","type":"journal-article","created":{"date-parts":[[2016,9,15]],"date-time":"2016-09-15T17:46:17Z","timestamp":1473961577000},"page":"279-292","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":4,"special_numbering":"C","title":["Optimization based spectral partitioning for node criticality assessment"],"prefix":"10.1016","volume":"75","author":[{"given":"Waqar","family":"Asif","sequence":"first","affiliation":[]},{"given":"Marios","family":"Lestas","sequence":"additional","affiliation":[]},{"given":"Hassaan","family":"Khaliq Qureshi","sequence":"additional","affiliation":[]},{"given":"Muttukrishnan","family":"Rajarajan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib1","doi-asserted-by":"crossref","first-page":"025103","DOI":"10.1103\/PhysRevE.69.025103","article-title":"Structural vulnerability of the north american power grid","volume":"69","author":"Albert","year":"2004","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.jnca.2016.09.003_bib2","unstructured":"Arulselvan, A., Commander, C.W., Pardalos, P.M., Shylo, O. 2007. Managing network risk via critical node identification. Risk Management in Telecommunication Networks. Springer, Heidelberg."},{"issue":"7","key":"10.1016\/j.jnca.2016.09.003_bib3","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.cor.2008.08.016","article-title":"Detecting critical nodes in sparse graphs","volume":"36","author":"Arulselvan","year":"2009","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.jnca.2016.09.003_bib4","doi-asserted-by":"crossref","unstructured":"Asif, W., Qureshi, H.K., Rajarajan, M., 2013. Variable rate adaptive modulation (vram) for introducing small-world model into wsns. In: 47th Annual Conference on Information Sciences and Systems (CISS). IEEE, Johns Hopkins University, 3400 North Charles Street, Baltimore, MD, USA, pp. 1\u20136.","DOI":"10.1109\/CISS.2013.6552329"},{"key":"10.1016\/j.jnca.2016.09.003_bib5","doi-asserted-by":"crossref","unstructured":"Asif, W., Qureshi, H., Rajarajan, M., Lestas, M., 2014. Cbdi: Combined banzhaf amp; diversity index for finding critical nodes. In: IEEE Global Communications Conference (GLOBECOM). pp. 758\u2013763.","DOI":"10.1109\/GLOCOM.2014.7036899"},{"key":"10.1016\/j.jnca.2016.09.003_bib6","doi-asserted-by":"crossref","unstructured":"Asif, W., Lestas, M., Qureshi, H.K., Rajarajan, M., 2015. Spectral partitioning for node criticality. In: International Symposium on Computers and Communication (ISCC). IEEE, Larnaca, Cyprus, pp. 877\u2013882.","DOI":"10.1109\/ISCC.2015.7405624"},{"key":"10.1016\/j.jnca.2016.09.003_bib7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.jnca.2015.11.025","article-title":"Combined banzhaf & diversity index (cbdi) for critical node detection","volume":"64","author":"Asif","year":"2016","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.jnca.2016.09.003_bib8","doi-asserted-by":"crossref","unstructured":"Bader, D., Madduri, K., et al., 2006. Parallel algorithms for evaluating centrality indices in real-world networks. In: International Conference on Parallel Processing ICPP. IEEE, pp. 539\u2013550.","DOI":"10.1109\/ICPP.2006.57"},{"issue":"5","key":"10.1016\/j.jnca.2016.09.003_bib9","doi-asserted-by":"crossref","first-page":"1106","DOI":"10.1016\/j.sigpro.2012.12.002","article-title":"Distributed computation of the fiedler vector with application to topology inference in ad hoc networks","volume":"93","author":"Bertrand","year":"2013","journal-title":"Signal Process."},{"issue":"4","key":"10.1016\/j.jnca.2016.09.003_bib10","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1016\/j.socnet.2007.04.002","article-title":"Some unique properties of eigenvector centrality","volume":"29","author":"Bonacich","year":"2007","journal-title":"Soc. Netw."},{"key":"10.1016\/j.jnca.2016.09.003_bib11","doi-asserted-by":"crossref","unstructured":"Chen, P.-Y., Hero, A.O., 2014. Local fiedler vector centrality for detection of deep and overlapping communities in networks. In: International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, Florence, Italy, pp. 1120\u20131124.","DOI":"10.1109\/ICASSP.2014.6853771"},{"key":"10.1016\/j.jnca.2016.09.003_bib12","doi-asserted-by":"crossref","unstructured":"Christiano, P., Kelner, J.A., Madry, A., Spielman, D.A., Teng, S.-H., 2011. Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing. ACM, San Jose, California, pp. 273\u2013282.","DOI":"10.1145\/1993636.1993674"},{"issue":"1","key":"10.1016\/j.jnca.2016.09.003_bib13","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.laa.2006.08.017","article-title":"Old and new results on algebraic connectivity of graphs","volume":"423","author":"de Abreu","year":"2007","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib14","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1109\/TNET.2011.2170849","article-title":"On new approaches of assessing network vulnerability","volume":"20","author":"Dinh","year":"2012","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"10.1016\/j.jnca.2016.09.003_bib15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/j.socnet.2004.11.007","article-title":"Ego network betweenness","volume":"27","author":"Everett","year":"2005","journal-title":"Soc. Netw."},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib16","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Math. J."},{"issue":"4","key":"10.1016\/j.jnca.2016.09.003_bib17","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","article-title":"A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory","volume":"25","author":"Fiedler","year":"1975","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/j.jnca.2016.09.003_bib18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.2307\/3033543","article-title":"A set of measures of centrality based on betweenness","author":"Freeman","year":"1977","journal-title":"Sociometry"},{"issue":"3","key":"10.1016\/j.jnca.2016.09.003_bib19","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman","year":"1979","journal-title":"Soc. Netw."},{"key":"10.1016\/j.jnca.2016.09.003_bib20","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Boyd, S., 2006. Growing well-connected graphs. In: 45th IEEE Conference on Decision and Control. IEEE, San Jose, California, pp. 6605\u20136611.","DOI":"10.1109\/CDC.2006.377282"},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib21","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1137\/1015032","article-title":"Some modified matrix eigenvalue problems","volume":"15","author":"Golub","year":"1973","journal-title":"SIAM Rev."},{"key":"10.1016\/j.jnca.2016.09.003_bib22","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1016\/0024-3795(95)00199-2","article-title":"Interlacing eigenvalues and graphs","volume":"226","author":"Haemers","year":"1995","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/j.jnca.2016.09.003_bib23","doi-asserted-by":"crossref","unstructured":"Haenggi, M., 2003. Energy-balancing strategies for wireless sensor networks. In: Proceedings of the International Symposium on Circuits and Systems, ISCAS'03, vol. 4. IEEE, Bangkok, pp. IV-828.","DOI":"10.1109\/ISCAS.2003.1206348"},{"issue":"12","key":"10.1016\/j.jnca.2016.09.003_bib24","doi-asserted-by":"crossref","first-page":"2140","DOI":"10.1016\/j.comnet.2009.03.012","article-title":"On the reliability of large-scale distributed systems-a topological view","volume":"53","author":"He","year":"2009","journal-title":"Comput. Netw."},{"issue":"5","key":"10.1016\/j.jnca.2016.09.003_bib25","doi-asserted-by":"crossref","first-page":"056109","DOI":"10.1103\/PhysRevE.65.056109","article-title":"Attack vulnerability of complex networks","volume":"65","author":"Holme","year":"2002","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.jnca.2016.09.003_bib26","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1016\/j.procs.2013.06.166","article-title":"Localized algorithm for segregation of critical\/non-critical nodes in mobile ad hoc and sensor networks","volume":"19","author":"Imran","year":"2013","journal-title":"Procedia Comput. Sci."},{"key":"10.1016\/j.jnca.2016.09.003_bib27","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","article-title":"Rate control for communication networks","author":"Kelly","year":"1998","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.jnca.2016.09.003_bib28","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1002\/ett.4460080106","article-title":"Charging and rate control for elastic traffic","volume":"8","author":"Kelly","year":"1997","journal-title":"Eur. Trans. Telecommun."},{"key":"10.1016\/j.jnca.2016.09.003_bib29","volume":"vol. 768","author":"Kutz","year":"2004"},{"issue":"5","key":"10.1016\/j.jnca.2016.09.003_bib30","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1109\/TNET.2011.2149540","article-title":"A new estimation scheme for the effective number of users in internet congestion control","volume":"19","author":"Lestas","year":"2011","journal-title":"IEEE\/ACM Trans. Networking (TON)"},{"issue":"3","key":"10.1016\/j.jnca.2016.09.003_bib31","doi-asserted-by":"crossref","first-page":"622","DOI":"10.3390\/app5030622","article-title":"Critical nodes identification of power systems based on controllability of complex networks","volume":"5","author":"Li","year":"2015","journal-title":"Appl. Sci."},{"issue":"7346","key":"10.1016\/j.jnca.2016.09.003_bib32","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1038\/nature10011","article-title":"Controllability of complex networks","volume":"473","author":"Liu","year":"2011","journal-title":"Nature"},{"issue":"3","key":"10.1016\/j.jnca.2016.09.003_bib33","doi-asserted-by":"crossref","first-page":"1843","DOI":"10.3182\/20140824-6-ZA-1003.02699","article-title":"Distributed identification of the most critical node for average consensus","volume":"47","author":"Liu","year":"2014","journal-title":"IFAC Proc. Volumes"},{"issue":"16","key":"10.1016\/j.jnca.2016.09.003_bib34","doi-asserted-by":"crossref","first-page":"4315","DOI":"10.1109\/TSP.2015.2441039","article-title":"Distributed identification of the most critical node for average consensus","volume":"63","author":"Liu","year":"2015","journal-title":"IEEE Trans. Signal Process."},{"key":"10.1016\/j.jnca.2016.09.003_bib35","unstructured":"MathWorks, Matlab 2013, \u3008http:\/\/www.mathworks.com\/support\/sysreq\/sv-r2013a\/\u3009."},{"key":"10.1016\/j.jnca.2016.09.003_bib36","doi-asserted-by":"crossref","unstructured":"Mbarushimana, C., Shahrabi, A., 2007. Comparative study of reactive and proactive routing protocols performance in mobile ad hoc networks. In: 21st International Conference on Advanced Information Networking and Applications Workshops, vol. 2. IEEE, Niagara Falls, Canada, pp. 679\u2013684.","DOI":"10.1109\/AINAW.2007.123"},{"key":"10.1016\/j.jnca.2016.09.003_bib37","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0024-3795(94)90486-3","article-title":"Laplacian matrices of graphs","volume":"197","author":"Merris","year":"1994","journal-title":"Linear Algebra and its Applications"},{"key":"10.1016\/j.jnca.2016.09.003_bib38","first-page":"871","article-title":"The Laplacian spectrum of graphs","volume":"2","author":"Mohar","year":"1991","journal-title":"Graph Theory, Combinatorics, and Applications"},{"issue":"1","key":"10.1016\/j.jnca.2016.09.003_bib39","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.socnet.2004.11.009","article-title":"A measure of betweenness centrality based on random walks","volume":"27","author":"Newman","year":"2005","journal-title":"Soc. Netw."},{"key":"10.1016\/j.jnca.2016.09.003_bib40","unstructured":"NSNAM, Network simulator 3, \u3008https:\/\/www.nsnam.org\/ \u3009."},{"issue":"12","key":"10.1016\/j.jnca.2016.09.003_bib41","doi-asserted-by":"crossref","first-page":"2254","DOI":"10.1109\/TAC.2007.910665","article-title":"Alternative distributed algorithms for network utility maximization","volume":"52","author":"Palomar","year":"2007","journal-title":"IEEE Trans. Autom. Control"},{"issue":"7","key":"10.1016\/j.jnca.2016.09.003_bib42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(00)00060-2","article-title":"Bounds for sums of eigenvalues and applications","volume":"39","author":"Rojo","year":"2000","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.jnca.2016.09.003_bib43","doi-asserted-by":"crossref","unstructured":"Saroiu, S., Gummadi, P.K., Gribble, S.D., 2001. Measurement study of peer-to-peer file sharing systems. In: Electronic Imaging, International Society for Optics and Photonics. pp. 156\u2013170.","DOI":"10.1117\/12.449977"},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib44","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/net.20464","article-title":"Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs","volume":"60","author":"Shen","year":"2012","journal-title":"Networks"},{"issue":"3","key":"10.1016\/j.jnca.2016.09.003_bib45","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1109\/TNET.2012.2215882","article-title":"On the discovery of critical links and nodes for assessing network vulnerability","volume":"21","author":"Shen","year":"2013","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"10.1016\/j.jnca.2016.09.003_bib46","doi-asserted-by":"crossref","first-page":"1913","DOI":"10.1137\/080734029","article-title":"Graph sparsification by effective resistances","volume":"40","author":"Spielman","year":"2011","journal-title":"SIAM J. Comput."},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib47","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.laa.2006.07.020","article-title":"Spectral partitioning works","volume":"421","author":"Spielman","year":"2007","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/j.jnca.2016.09.003_bib48","article-title":"Bounds on the algebraic connectivity of graphs","volume":"41","author":"Tian","year":"2012","journal-title":"Adv. Math."},{"issue":"1","key":"10.1016\/j.jnca.2016.09.003_bib49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/s40649-015-0010-y","article-title":"Efficiently identifying critical nodes in large complex networks","volume":"2","author":"Ventresca","year":"2015","journal-title":"Comput. Soc. Netw."},{"issue":"4","key":"10.1016\/j.jnca.2016.09.003_bib50","doi-asserted-by":"crossref","first-page":"046102","DOI":"10.1103\/PhysRevE.82.046102","article-title":"Enhancing the spectral gap of networks by node removal","volume":"82","author":"Watanabe","year":"2010","journal-title":"Phys. Rev. E"},{"key":"10.1016\/j.jnca.2016.09.003_bib51","doi-asserted-by":"crossref","unstructured":"Wei, P., Sun, D., 2011. Weighted algebraic connectivity: An application to airport transportation network. In: Proceedings of the 18th IFAC World Congress, Milan, Italy.","DOI":"10.3182\/20110828-6-IT-1002.00486"},{"key":"10.1016\/j.jnca.2016.09.003_bib52","unstructured":"Xiaochun, X., Xiaoyan, W., 2003. A simple rate control algorithm for maximizing total user utility. In: Proceedings of the International Conference on Communication Technology, pp. 135\u2013138."},{"issue":"9","key":"10.1016\/j.jnca.2016.09.003_bib53","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/JSAC.2013.SUP.0513058","article-title":"Consub","volume":"31","author":"Zhou","year":"2013","journal-title":"IEEE J. Select. Areas Commun."},{"issue":"9","key":"10.1016\/j.jnca.2016.09.003_bib54","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1109\/TPDS.2014.2366474","article-title":"Incentive-driven and freshness-aware content dissemination in selfish opportunistic mobile networks","volume":"26","author":"Zhou","year":"2015","journal-title":"IEEE Trans. Parallel Distrib. Syst."}],"container-title":["Journal of Network and Computer Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804516302004?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1084804516302004?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,9,25]],"date-time":"2020-09-25T21:58:42Z","timestamp":1601071122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1084804516302004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11]]},"references-count":54,"alternative-id":["S1084804516302004"],"URL":"https:\/\/doi.org\/10.1016\/j.jnca.2016.09.003","relation":{},"ISSN":["1084-8045"],"issn-type":[{"value":"1084-8045","type":"print"}],"subject":[],"published":{"date-parts":[[2016,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Optimization based spectral partitioning for node criticality assessment","name":"articletitle","label":"Article Title"},{"value":"Journal of Network and Computer Applications","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jnca.2016.09.003","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2016 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}