{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:55:51Z","timestamp":1725566151179},"publisher-location":"New York, NY","reference-count":30,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9781441965141"},{"type":"electronic","value":"9781441965158"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-1-4419-6515-8_15","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T12:56:10Z","timestamp":1284555370000},"page":"389-409","source":"Crossref","is-referenced-by-count":5,"title":["Interactive Graph Summarization"],"prefix":"10.1007","author":[{"given":"Yuanyuan","family":"Tian","sequence":"first","affiliation":[]},{"given":"Jignesh M.","family":"Patel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,8,13]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"M. Adler and M. Mitzenmacher. Towards compressing web graphs. In Proceedings of the Data Compression Conference (DCC\u201901), page 203, IEEE Computer Society, Washington, DC, USA, 2001.","DOI":"10.1109\/DCC.2001.917151"},{"key":"15_CR2","unstructured":"D. A. Bader and K. Madduri. GTgraph: A suite of synthetic graph generators. http:\/\/www.cc.gatech.edu\/\u223ckamesh\/GTgraph ."},{"key":"15_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs.","author":"G. Battista","year":"1999","unstructured":"G. Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Englewood Cliffs, NJ 1999."},{"issue":"1\u20137","key":"15_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1016\/S0169-7552(98)80047-0","volume":"30","author":"K. Bharat","year":"1998","unstructured":"K. Bharat, A. Broder, M. Henzinger, P. Kumar, and S. Venkatasubramanian. The connectivity server: Fast access to linkage information on the Web. Computer Networks and ISDN Systems, 30(1\u20137):469\u2013477, 1998.","journal-title":"Computer Networks and ISDN Systems"},{"key":"15_CR5","unstructured":"D. K. Blandford, G. E. Blelloch, and I. A. Kash. Compact representations of separable graphs. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA\u201903), pages 679\u2013688, Baltimore, Maryland, USA, 2003."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"P. Boldi and S. Vigna. The WebGraph framework I: Compression techniques. In Proceedings of the International World Wide Web Conference (WWW\u201904), pages 595\u2013602, New York, NY, USA, 2004.","DOI":"10.1145\/988672.988752"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"P. Boldi and S. Vigna. The WebGraph framework II: Codes for the World-Wide Web. In Proceedings of the Data Compression Conference (DCC\u201904), page 528, Snowbird, Utah, USA, 2004.","DOI":"10.1145\/988672.988752"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"S. Brin and L. Page. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the International World Wide Web Conference (WWW\u201998), pages 107\u2013117, Amsterdam, The Netherlands, 1998.","DOI":"10.1016\/S0169-7552(98)00110-X"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proceedings of the SIAM International Conference on Data Mining (SDM\u201904), Lake Buena Vista, Florida, USA, 2004.","DOI":"10.1137\/1.9781611972740.43"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/S0019-9958(83)80004-7","volume":"56","author":"H. Galperin","year":"1983","unstructured":"H. Galperin and A. Wigderson. Succinct representations of graphs. Information and Control, 56(3):183\u2013198, 1983.","journal-title":"Information and Control"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"J. Gray, A. Bosworth, A. Layman, and H. Pirahesh. Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total. In Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201996), pages 152\u2013159, New Orleans, Louisiana, USA, 1996.","DOI":"10.1109\/ICDE.1996.492099"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"X. He, M.-Y. Kao, and H.-I. Lu. A fast general methodology for information - theoretically optimal encodings of graphs. In Proceedings of the European Symposium on Algorithms (ESA\u201999), pages 540\u2013549, London, UK, 1999.","DOI":"10.1007\/3-540-48481-7_47"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/2945.841119","volume":"6","author":"I. Herman","year":"2000","unstructured":"I. Herman, G. Melan\u00e7on, and M. S. Marshall. Graph visualization and navigation in information visualization: A survey. IEEE Transactions on Visualization and Computer Graphics, 6(1):24\u201343, 2000.","journal-title":"IEEE Transactions on Visualization and Computer Graphics"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"M. L. Huang and P. Eades. A fully animated interactive system for clustering and navigating huge graphs. In Proceedings of the International Symposium on Graph Drawing (GD\u201998), pages 374\u2013383, London, UK, 1998.","DOI":"10.1007\/3-540-37623-2_29"},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(93)E0150-W","volume":"58","author":"K. Keeler","year":"1995","unstructured":"K. Keeler and J. Westbrook. Short encodings of planar graphs and maps. Discrete Applied Mathematics, 58(3):239\u2013252, 1995.","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"R. Kumar, P. Raghavan, S. Rajagopalan, and A. Tomkins. Trawling the Web for emerging cyber-communities. In Proceedings of the International World Wide Web Conference (WWW\u201999), pages 1481\u20131493, Toronto, Canada, 1999.","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"15_CR17","unstructured":"M. Ley. DBLP Bibliography. http:\/\/www.informatik.uni-trier.de\/\u223cley\/db\/ ."},{"key":"15_CR18","unstructured":"H.-I. Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA\u201902), pages 223\u2013224, San Francisco, California, USA, 2002."},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"S. Navlakha, R. Rastogi, and N. Shrivastava. Graph summarization with bounded error. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD\u201908), pages 419\u2013432, Vancouver, Canada, 2008.","DOI":"10.1145\/1376616.1376661"},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M. E. J. Newman","year":"2003","unstructured":"M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45(2):167\u2013256, 2003.","journal-title":"SIAM Review"},{"key":"15_CR21","unstructured":"S. Raghavan and H. Garcia-Molina. Representing Web graphs. In Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201903), pages 405\u2013416, Bangalore, India, 2003."},{"key":"15_CR22","unstructured":"K. H. Randall, R. Stata, R. G. Wickremesinghe, and J. L. Wiener. The link database: Fast access to graphs of the Web. In Proceedings of the Data Compression Conference (DCC\u201902), pages 122\u2013131, Washington, DC, USA, 2002."},{"key":"15_CR23","unstructured":"D. G. Ravi, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In Proceedings of the International Conference on Very Large Data Bases (VLDB\u201905), pages 721\u2013732, Trondheim, Norway, 2005."},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"J. S. Risch, D. B. Rex, S. T. Dowson, T. B. Walters, R. A. May, and B. D. Moon. The STARLIGHT information visualization system. In Proceedings of the IEEE Conference on Information Visualisation (IV\u201997), San Francisco, CA, USA, page 42, 1997.","DOI":"10.1109\/IV.1997.626486"},{"key":"15_CR25","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J. Rissanen","year":"1978","unstructured":"J. Rissanen. Modeling by shortest data description. Automatica, 14:465\u2013471, 1978.","journal-title":"Automatica"},{"key":"15_CR26","doi-asserted-by":"crossref","unstructured":"J. F. Rodrigues, A. J. M. Traina, C. Faloutsos, and C. Traina. SuperGraph visualization. In Proceedings of the IEEE International Symposium on Multimedia (ISM\u201906), Washington, DC, USA, 2006.","DOI":"10.1109\/ISM.2006.143"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"T. Suel and J. Yuan. Compressing the graph structure of the Web. In Proceedings of the Data Compression Conference (DCC\u201901), pages 213\u2013222, Washington, DC, USA, 2001.","DOI":"10.1109\/DCC.2001.917152"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Y. Tian, R. A. Hankins, and J. M. Patel. Efficient aggregation for graph summarization. In Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD\u201908), pages 567\u2013580, Vancouver, Canada, 2008.","DOI":"10.1145\/1376616.1376675"},{"issue":"2","key":"15_CR29","first-page":"190","volume":"8","author":"G. J. Wills","year":"1999","unstructured":"G. J. Wills. NicheWorks \u2014 interactive visualization of very large graphs. Journal of Computational and Graphical Statistics, 8(2):190\u2013212, 1999.","journal-title":"Journal of Computational and Graphical Statistics"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"N. Zhang, Y. Tian, and J. M. Patel. Discovery-driven graph summarization. In Proceedings of the IEEE International Conference on Data Engineering (ICDE\u201910), Long Beach, California, USA, 2010.","DOI":"10.1109\/ICDE.2010.5447830"}],"container-title":["Link Mining: Models, Algorithms, and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-6515-8_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T16:12:40Z","timestamp":1559664760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4419-6515-8_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9781441965141","9781441965158"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-6515-8_15","relation":{},"subject":[],"published":{"date-parts":[[2010]]}}}