{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T22:32:42Z","timestamp":1768775562412,"version":"3.49.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1109\/iscas.2018.8351133","type":"proceedings-article","created":{"date-parts":[[2018,5,4]],"date-time":"2018-05-04T22:00:05Z","timestamp":1525471205000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["A New Metric to Find the Most Vulnerable Node in Complex Networks"],"prefix":"10.1109","author":[{"given":"Ali Moradi","family":"Amani","sequence":"first","affiliation":[]},{"given":"Mahdi","family":"Jalili","sequence":"additional","affiliation":[]},{"given":"Xinghuo","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Lewi","family":"Stone","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2011.2116117"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79549-0_16"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.81.046112"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.80.2109"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.82.046102"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.71.056103"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2016.2601565"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.91.012803"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.94.218701"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1038\/30918"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.66.065102"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0038398"},{"key":"ref6","first-page":"5","article-title":"Error and attack tolerance of complex networks","volume":"406","author":"re'ka albert hawoong","year":"2000","journal-title":"Nature"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1002\/acs.2497"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1038\/nature08932","article-title":"Catastrophic cascade of failures in interdependent networks","volume":"464","author":"buldyrev","year":"2010","journal-title":"Nature"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/81.974874"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature10011"},{"key":"ref1","author":"mieghem","year":"2011","journal-title":"Graph Spectra for Complex Networks"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0059613"},{"key":"ref20","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hungar Acad Sci"},{"key":"ref21","article-title":"Graph eigenvectors, fundamental weights and centrality metrics for nodes in networks","author":"van mieghem","year":"2014"}],"event":{"name":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","location":"Florence","start":{"date-parts":[[2018,5,27]]},"end":{"date-parts":[[2018,5,30]]}},"container-title":["2018 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8334884\/8350884\/08351133.pdf?arnumber=8351133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:53:39Z","timestamp":1571705619000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8351133\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/iscas.2018.8351133","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}