{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T19:41:57Z","timestamp":1725392517836},"reference-count":9,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1109\/iscas.2017.8050468","type":"proceedings-article","created":{"date-parts":[[2017,9,28]],"date-time":"2017-09-28T16:33:32Z","timestamp":1506616412000},"page":"1-4","source":"Crossref","is-referenced-by-count":0,"title":["Efficient spectral graph sparsification via Krylov-subspace based spectral perturbation analysis"],"prefix":"10.1109","author":[{"given":"Shuhan","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Fan","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Xuan","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Dian","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Shun","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xiangdong","family":"Hu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/050641661"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2898094"},{"key":"ref5","article-title":"A note on preconditioning by low-stretch spanning trees","author":"spielman","year":"2009","journal-title":"Computer Science"},{"journal-title":"Numerical Mathematics","year":"1979","author":"quarteroni","key":"ref8"},{"key":"ref7","first-page":"608","article-title":"Spielman, and ShanghuaTeng. Lower-stretch spanning trees","author":"michael","year":"2005","journal-title":"thirty-seventh annual ACM symposium on Theory of computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"ref1","first-page":"2698","article-title":"Algorithms, graph theory, and linear equations in laplacian matrices","author":"spielman","year":"2010","journal-title":"International Congress of Mathematicians"}],"event":{"name":"2017 IEEE International Symposium on Circuits and Systems (ISCAS)","start":{"date-parts":[[2017,5,28]]},"location":"Baltimore, MD, USA","end":{"date-parts":[[2017,5,31]]}},"container-title":["2017 IEEE International Symposium on Circuits and Systems (ISCAS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8014728\/8049747\/08050468.pdf?arnumber=8050468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,27]],"date-time":"2017-10-27T17:33:58Z","timestamp":1509125638000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8050468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5]]},"references-count":9,"URL":"https:\/\/doi.org\/10.1109\/iscas.2017.8050468","relation":{},"subject":[],"published":{"date-parts":[[2017,5]]}}}