{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T05:30:32Z","timestamp":1769578232689,"version":"3.49.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319739144","type":"print"},{"value":"9783319739151","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-73915-1_22","type":"book-chapter","created":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T03:42:19Z","timestamp":1516419739000},"page":"272-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Drawing Big Graphs Using Spectral Sparsification"],"prefix":"10.1007","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Quan","family":"Nguyen","sequence":"additional","affiliation":[]},{"given":"Seok-Hee","family":"Hong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,21]]},"reference":[{"issue":"8","key":"22_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/2492007.2492029","volume":"56","author":"JD Batson","year":"2013","unstructured":"Batson, J.D., Spielman, D.A., Srivastava, N., Teng, S.: Spectral sparsification of graphs: theory and algorithms. Commun. ACM 56(8), 87\u201394 (2013)","journal-title":"Commun. ACM"},{"key":"22_CR2","volume-title":"Generalized Inverses: Theory and Applications","author":"A Ben-Israel","year":"2003","unstructured":"Ben-Israel, A., Greville, T.N.: Generalized Inverses: Theory and Applications, vol. 15. Springer Science & Business Media, New York (2003)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Bencz\u00far, A.A., Karger, D.R.: Approximating s-t minimum cuts in \u00d5(n$${}^{\\text{2}}$$) time. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, 22\u201324 May 1996, pp. 47\u201355 (1996)","DOI":"10.1145\/237814.237827"},{"key":"22_CR4","volume-title":"The Open Graph Drawing Framework (OGDF)","author":"M Chimani","year":"2012","unstructured":"Chimani, M., Gutwenger, C., J\u00fcnger, M., Klau, G.W., Klein, K., Mutzel, P.: The Open Graph Drawing Framework (OGDF). CRC Press, Boca Raton (2012)"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Chung, F.: Spectral Graph Theory. American Maths Society (1997)","DOI":"10.1090\/cbms\/092"},{"issue":"1","key":"22_CR6","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00405","volume":"21","author":"P Eades","year":"2017","unstructured":"Eades, P., Hong, S., Nguyen, A., Klein, K.: Shape-based quality metrics for large graph visualization. J. Graph Algorithms Appl. 21(1), 29\u201353 (2017). https:\/\/doi.org\/10.7155\/jgaa.00405","journal-title":"J. Graph Algorithms Appl."},{"issue":"1","key":"22_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.7155\/jgaa.00405","volume":"21","author":"P Eades","year":"2017","unstructured":"Eades, P., Hong, S., Nguyen, A., Klein, K.: Shape-based quality metrics for large graph visualization. J. Graph Algorithms Appl. 21(1), 29\u201353 (2017)","journal-title":"J. Graph Algorithms Appl."},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Gjoka, M., Kurant, M., Butts, C.T., Markopoulou, A.: Walking in facebook: a case study of unbiased sampling of OSNs. In: Proceedings of the 29th Conference on Information Communications, INFOCOM 2010 pp. 2498\u20132506. IEEE Press, Piscataway (2010)","DOI":"10.1109\/INFCOM.2010.5462078"},{"key":"22_CR10","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"CD Godsil","year":"2001","unstructured":"Godsil, C.D., Royle, G.F.: Algebraic Graph Theory. Graduate Texts in Mathematics. Springer, New York (2001). https:\/\/doi.org\/10.1007\/978-1-4613-0163-9"},{"key":"22_CR11","volume-title":"Handbook of Graph Theory","author":"J Gross","year":"2004","unstructured":"Gross, J., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2004)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-540-31843-9_29","volume-title":"Graph Drawing","author":"S Hachul","year":"2005","unstructured":"Hachul, S., J\u00fcnger, M.: Drawing large graphs with a potential-field-based multilevel algorithm. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 285\u2013295. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31843-9_29"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Hare, J.S., Samangooei, S., Dupplaw, D.: OpenIMAJ and ImageTerrier: Java libraries and tools for scalable multimedia analysis and indexing of images. In: Proceedings of the 19th International Conference on Multimedia 2011, pp. 691\u2013694 (2011)","DOI":"10.1145\/2072298.2072421"},{"key":"22_CR14","unstructured":"Hu, P., Lau, W.C.: A survey and taxonomy of graph sampling. CoRR abs\/1308.5865 (2013)"},{"issue":"2","key":"22_CR15","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1002\/wics.1343","volume":"7","author":"Y Hu","year":"2015","unstructured":"Hu, Y., Shi, L.: Visualizing large graphs. WIREs Comput. Stat. 7(2), 115\u2013136 (2015). https:\/\/doi.org\/10.1002\/wics.1343","journal-title":"WIREs Comput. Stat."},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Faloutsos, C.: Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 631\u2013636. ACM (2006)","DOI":"10.1145\/1150402.1150479"},{"key":"22_CR17","unstructured":"Lov\u00e1sz, L.: Random walks on graphs: a survey. In: Mikl\u00f3s, D., S\u00f3s, V.T., Sz\u0151nyi, T. (eds.) Combinatorics, Paul Erd\u0151s is Eighty, vol. 2, pp. 353\u2013398. J\u00e1nos Bolyai Mathematical Society (1996)"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-662-45803-7_10","volume-title":"Graph Drawing","author":"MR Marner","year":"2014","unstructured":"Marner, M.R., Smith, R.T., Thomas, B.H., Klein, K., Eades, P., Hong, S.-H.: GION: interactively untangling large graphs on wall-sized displays. In: Duncan, C., Symvonis, A. (eds.) GD 2014. LNCS, vol. 8871, pp. 113\u2013124. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45803-7_10"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Morstatter, F., Pfeffer, J., Liu, H., Carley, K.: Is the sample good enough? Comparing data from Twitter\u2019s streaming API with Twitter\u2019s firehose, pp. 400\u2013408. AAAI press (2013)","DOI":"10.1609\/icwsm.v7i1.14401"},{"issue":"6","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1600","DOI":"10.1109\/TVCG.2017.2674999","volume":"23","author":"QH Nguyen","year":"2017","unstructured":"Nguyen, Q.H., Hong, S.H., Eades, P., Meidiana, A.: Proxy graph: visual quality metrics of big graph sampling. IEEE Trans. Visual Comput. Graphics 23(6), 1600\u20131611 (2017)","journal-title":"IEEE Trans. Visual Comput. Graphics"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-36763-2_55","volume-title":"Graph Drawing","author":"Q Nguyen","year":"2013","unstructured":"Nguyen, Q., Eades, P., Hong, S.-H.: On the faithfulness of graph visualizations. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 566\u2013568. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36763-2_55"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Nguyen, Q.H., Eades, P., Hong, S.: On the faithfulness of graph visualizations. In: IEEE Pacific Visualization Symposium, PacificVis 2013, 27 February\u20131 March 2013, Sydney, NSW, Australia, pp. 209\u2013216 (2013). https:\/\/doi.org\/10.1109\/PacificVis.2013.6596147","DOI":"10.1109\/PacificVis.2013.6596147"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Rafiei, D., Curial, S.: Effectively visualizing large networks through sampling. In: 16th IEEE Visualization Conference, VIS 2005, Minneapolis, MN, USA, 23\u201328 October 2005, pp. 375\u2013382 (2005)","DOI":"10.1109\/VISUAL.2005.1532819"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Rossi, R.A., Ahmed, N.K.: The network data repository with interactive graph analytics and visualization. In: AAAI (2015). http:\/\/networkrepository.com","DOI":"10.1609\/aaai.v29i1.9277"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Spielman, D.A., Srivastava, N.: Graph sparsification by effective resistances. CoRR abs\/0803.0929 (2008). http:\/\/arxiv.org\/abs\/0803.0929","DOI":"10.1145\/1374376.1374456"},{"issue":"4","key":"22_CR26","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1137\/08074489X","volume":"40","author":"DA Spielman","year":"2011","unstructured":"Spielman, D.A., Teng, S.: Spectral sparsification of graphs. SIAM J. Comput. 40(4), 981\u20131025 (2011)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"22_CR27","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980). https:\/\/doi.org\/10.1016\/0031-3203(80)90066-7","journal-title":"Pattern Recogn."},{"issue":"4","key":"22_CR28","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Von Luxburg","year":"2007","unstructured":"Von Luxburg, U.: A tutorial on spectral clustering. Stat. Comput. 17(4), 395\u2013416 (2007)","journal-title":"Stat. Comput."},{"issue":"1","key":"22_CR29","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1109\/TVCG.2016.2598867","volume":"23","author":"Y Wu","year":"2017","unstructured":"Wu, Y., Cao, N., Archambault, D., Shen, Q., Qu, H., Cui, W.: Evaluation of graph sampling: a visualization perspective. IEEE Trans. Visual Comput. Graphics 23(1), 401\u2013410 (2017)","journal-title":"IEEE Trans. Visual Comput. Graphics"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing and Network Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-73915-1_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T23:09:15Z","timestamp":1751238555000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-73915-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319739144","9783319739151"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-73915-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"GD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Graph Drawing and Network Visualization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Boston","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"gd2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/gd2017.ccis.northeastern.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}