{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:26:05Z","timestamp":1729671965071,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1109\/iscc.2015.7405624","type":"proceedings-article","created":{"date-parts":[[2016,2,16]],"date-time":"2016-02-16T00:54:13Z","timestamp":1455584053000},"page":"877-882","source":"Crossref","is-referenced-by-count":3,"title":["Spectral partitioning for node criticality"],"prefix":"10.1109","author":[{"given":"Waqar","family":"Asif","sequence":"first","affiliation":[]},{"given":"Marios","family":"Lestas","sequence":"additional","affiliation":[]},{"given":"Hassaan Khaliq","family":"Qureshi","sequence":"additional","affiliation":[]},{"given":"Muttukrishnan","family":"Rajarajan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"1843","article-title":"Distributed identification of the most critical node for average consensus","volume":"19","author":"liu","year":"2014","journal-title":"world congress"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.046102"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2012.12.002"},{"key":"ref13","first-page":"871","article-title":"The laplacian spectrum of graphs","volume":"2","author":"mohar","year":"1991","journal-title":"Graph Theory Combinatorics and Applications"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(94)90486-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080734029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/1015032"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(95)00199-2"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/S0898-1221(00)00060-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90021-7"},{"key":"ref6","first-page":"510","article-title":"Networks of scientific papers","volume":"169","author":"yu","year":"1965","journal-title":"Science"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.11.007"},{"key":"ref8","article-title":"Weighted algebraic connectivity: An application to airport transportation network","author":"wei","year":"2011","journal-title":"Proceedings of the 18th IFAC World Congress"},{"key":"ref7","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 Mathematical Journal"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/net.21450"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/0160017607308679"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6853771"}],"event":{"name":"2015 20th IEEE Symposium on Computers and Communication (ISCC)","start":{"date-parts":[[2015,7,6]]},"location":"Larnaca","end":{"date-parts":[[2015,7,9]]}},"container-title":["2015 IEEE Symposium on Computers and Communication (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7397314\/7405441\/07405624.pdf?arnumber=7405624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T13:46:49Z","timestamp":1600177609000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7405624\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/iscc.2015.7405624","relation":{},"subject":[],"published":{"date-parts":[[2015,7]]}}}