{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:26:36Z","timestamp":1761744396772},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319469089"},{"type":"electronic","value":"9783319469096"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46909-6_25","type":"book-chapter","created":{"date-parts":[[2016,10,25]],"date-time":"2016-10-25T13:53:40Z","timestamp":1477403620000},"page":"276-286","source":"Crossref","is-referenced-by-count":13,"title":["Graph Methods for Social Network Analysis"],"prefix":"10.1007","author":[{"given":"Quoc Dinh","family":"Truong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quoc Bao","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taoufiq","family":"Dkaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,10,26]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Wasserman, S., Faust, K.: Social network analysis in the social and behavioral sciences. In: Social Network Analysis: Methods and Applications, pp. 1\u201327. Cambridge University Press (1994). ISBN 9780521387071","DOI":"10.1017\/CBO9780511815478.002"},{"key":"25_CR2","volume-title":"Social Network Analysis","author":"J Scott","year":"1992","unstructured":"Scott, J.: Social Network Analysis. Sage, Newbury Park (1992)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with Intelligent Placement. In Marks, J. (ed.) Proceedings of the Graph Drawing, pp. 222\u2013228. Colonial Wiliamsburg (2001)","DOI":"10.1007\/3-540-44541-2_21"},{"issue":"11","key":"25_CR4","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"TMJ Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Softw. Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. Pract. Exp."},{"issue":"1","key":"25_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett. 31(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","first-page":"426","volume-title":"Graph Drawing","author":"J Ho","year":"2013","unstructured":"Ho, J., Hong, S.-H., Gronemann, M., J\u00fcnger, M.: Drawing Clustered Graphs as Topographic Maps. In: Didimo, W., Patrignani, M. (eds.) GD 2012. LNCS, vol. 7704, pp. 426\u2013438. Springer, Heidelberg (2013)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1007\/978-3-540-24595-7_43","volume-title":"Graph Drawing","author":"J-H Chuang","year":"2004","unstructured":"Chuang, J.-H., Lin, C.-C., Yen, H.-C.: Drawing graphs with nonuniform nodes using potential fields. In: Liotta, G. (ed.) GD 2003. LNCS, vol. 2912, pp. 460\u2013465. Springer, Heidelberg (2004)"},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.7155\/jgaa.00029","volume":"4","author":"P Eades","year":"2000","unstructured":"Eades, P., Huang, M.L.: Navigating clustered graphs using force-directed methods. J. Graph Algorithms Appl. 4, 157\u2013181 (2000)","journal-title":"J. Graph Algorithms Appl."},{"key":"25_CR9","unstructured":"Truong, Q.D., Dkaki, T., Mothe, J., Charrel, P-J.: GVC: a graph-based information retrieval model. In: Conf\u00e9rence francophone en Recherche d\u2019Information et Applications (CORIA 2008), Tr\u00e9gastel (France), 12\u201314 Mar 2008, pp. 337\u2013351. CNRS (2008)"},{"issue":"4","key":"25_CR10","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1137\/S0036144502415960","volume":"46","author":"VD Blondel","year":"2004","unstructured":"Blondel, V.D., Gajardo, A., Heymans, M., Senellart, P., Van Dooren, P.: A measure of similarity between graph vertices: applications to synonym extraction and web searching. SIAM Rev. 46(4), 647\u2013666 (2004)","journal-title":"SIAM Rev."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Melnik, S., Garcia-Molina, H., Rahm, E.: Similarity flooding: a versatile graph matching algorithm and its application to scheme matching. In: Proceedings of the 18th ICDE Conference (2002)","DOI":"10.1109\/ICDE.2002.994702"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/3-540-45848-4_60","volume-title":"Graph Drawing","author":"TC Biedl","year":"2002","unstructured":"Biedl, T.C., Brandenburg, F.J.: Graph-Drawing Contest Report. In: Mutzel, P., J\u00fcnger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 513\u2013521. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Nature of Computation and Communication"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46909-6_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T02:02:59Z","timestamp":1498356179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46909-6_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319469089","9783319469096"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46909-6_25","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2016]]}}}