{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:05:22Z","timestamp":1762866322110,"version":"3.28.0"},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/bigdata.2013.6691629","type":"proceedings-article","created":{"date-parts":[[2014,1,3]],"date-time":"2014-01-03T14:11:49Z","timestamp":1388758309000},"page":"606-612","source":"Crossref","is-referenced-by-count":14,"title":["Scalable network traffic visualization using compressed graphs"],"prefix":"10.1109","author":[{"given":"Lei","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Liac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohua","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yarui","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chuang","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2012","key":"19"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557049"},{"year":"2011","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2012.208"},{"key":"16","first-page":"37","article-title":"Visual analysis of large graphs","author":"von landesberger","year":"2010","journal-title":"Eurographics 96 State-of-the-Art Report"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(78)90014-X"},{"key":"14","article-title":"The university of florida sparse matrix collection","volume":"38","author":"davis","year":"2009","journal-title":"ACM Trans Math Software"},{"key":"11","first-page":"3247","article-title":"Motif simplification: Improving network visualization readability with fan and parallel glyphs","author":"dunne","year":"2013","journal-title":"CHI"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.2307\/270991"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00052"},{"key":"2","article-title":"Graph drawing by stress majorization","author":"gansner","year":"2004","journal-title":"Graph Drawing"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00155"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1971.9989788"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.120"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFVIS.2003.1249011"},{"key":"4","first-page":"37","article-title":"Efficient and high quality force-directed graph drawing","volume":"10","author":"hu","year":"2005","journal-title":"Mathematica Journal"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.066133"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90025-4"}],"event":{"name":"2013 IEEE International Conference on Big Data","start":{"date-parts":[[2013,10,6]]},"location":"Silicon Valley, CA, USA","end":{"date-parts":[[2013,10,9]]}},"container-title":["2013 IEEE International Conference on Big Data"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679357\/6690588\/06691629.pdf?arnumber=6691629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T21:00:37Z","timestamp":1490216437000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6691629\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/bigdata.2013.6691629","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}