{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T00:11:19Z","timestamp":1769213479919,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,5]],"date-time":"2016-06-05T00:00:00Z","timestamp":1465084800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,5]]},"DOI":"10.1145\/2897937.2898094","type":"proceedings-article","created":{"date-parts":[[2016,5,25]],"date-time":"2016-05-25T20:14:10Z","timestamp":1464207250000},"page":"1-6","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":24,"title":["Spectral graph sparsification in nearly-linear time leveraging efficient spectral perturbation analysis"],"prefix":"10.1145","author":[{"given":"Zhuo","family":"Feng","sequence":"first","affiliation":[{"name":"Michigan Technological University, Houghton, MI"}]}],"member":"320","published-online":{"date-parts":[[2016,6,5]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the International Congress of Mathematicians Hyderabad","author":"Spielman D.","year":"2010","unstructured":"D. Spielman . Algorithms, graph theory , and linear equations in laplacian matrices . Proceedings of the International Congress of Mathematicians Hyderabad , 2010 . D. Spielman. Algorithms, graph theory, and linear equations in laplacian matrices. Proceedings of the International Congress of Mathematicians Hyderabad, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.29"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/090771430"},{"key":"e_1_3_2_1_5_1","first-page":"912","volume-title":"Proc. of ICML","volume":"3","author":"Zhu X.","year":"2003","unstructured":"X. Zhu , Z. Ghahramani , and J. Lafferty . Semi-supervised learning using gaussian fields and harmonic functions . In Proc. of ICML , volume 3 , pages 912 -- 919 , 2003 . X. Zhu, Z. Ghahramani, and J. Lafferty. Semi-supervised learning using gaussian fields and harmonic functions. In Proc. of ICML, volume 3, pages 912--919, 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374456"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806699"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993647"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/090772873"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429473"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228564"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2561828.2561925"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1137\/050641661"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214015"},{"key":"e_1_3_2_1_17_1","volume-title":"A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816","author":"Spielman D.","year":"2009","unstructured":"D. Spielman and J. Woo . A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816 , 2009 . D. Spielman and J. Woo. A note on preconditioning by low-stretch spanning trees. arXiv preprint arXiv:0903.2816, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970739"},{"key":"e_1_3_2_1_19_1","volume-title":"CHOLMOD: sparse supernodal Cholesky factorization and update\/downdate. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/www.cise.ufl.edu\/research\/sparse\/cholmod\/","author":"Davis T.","year":"2008","unstructured":"T. Davis . CHOLMOD: sparse supernodal Cholesky factorization and update\/downdate. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/www.cise.ufl.edu\/research\/sparse\/cholmod\/ , 2008 . T. Davis. CHOLMOD: sparse supernodal Cholesky factorization and update\/downdate. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/www.cise.ufl.edu\/research\/sparse\/cholmod\/, 2008."},{"key":"e_1_3_2_1_20_1","volume-title":"IBM power grid benchmarks. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/dropzone.tamu.edu\/pli\/PGBench\/","author":"Nassif S. R.","year":"2008","unstructured":"S. R. Nassif . IBM power grid benchmarks. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/dropzone.tamu.edu\/pli\/PGBench\/ , 2008 . S. R. Nassif. IBM power grid benchmarks. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/dropzone.tamu.edu\/pli\/PGBench\/, 2008."},{"key":"e_1_3_2_1_21_1","unstructured":"J. Yang and Z. Li. THU power grid benchmarks. {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/tiger.cs.tsinghua.edu.cn\/PGBench\/.  J. Yang and Z. Li. THU power grid benchmarks . {Online}. Available: https:\/\/linproxy.fan.workers.dev:443\/http\/tiger.cs.tsinghua.edu.cn\/PGBench\/."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049662.2049663"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2424958"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2376991"}],"event":{"name":"DAC '16: The 53rd Annual Design Automation Conference 2016","location":"Austin Texas","acronym":"DAC '16"},"container-title":["Proceedings of the 53rd Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2897937.2898094","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2897937.2898094","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:36Z","timestamp":1750222476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2897937.2898094"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,5]]},"references-count":24,"alternative-id":["10.1145\/2897937.2898094","10.1145\/2897937"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2897937.2898094","relation":{},"subject":[],"published":{"date-parts":[[2016,6,5]]},"assertion":[{"value":"2016-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}