{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T03:50:28Z","timestamp":1743133828693,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319151465"},{"type":"electronic","value":"9783319151472"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-15147-2_30","type":"book-chapter","created":{"date-parts":[[2015,3,19]],"date-time":"2015-03-19T14:46:02Z","timestamp":1426776362000},"page":"359-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Based on Force-Directed Algorithms Method for Metagraph Visualization"],"prefix":"10.1007","author":[{"given":"Larysa","family":"Globa","sequence":"first","affiliation":[]},{"given":"Maksym","family":"Ternovoy","sequence":"additional","affiliation":[]},{"given":"Olena","family":"Shtogrina","sequence":"additional","affiliation":[]},{"given":"Oleksandra","family":"Kryvenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,20]]},"reference":[{"issue":"2","key":"30_CR1","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/TVCG.2007.46","volume":"13","author":"D Archambault","year":"2007","unstructured":"Archambault, D., Munzner, T., Auber, D.: Topolayout: multilevel graph layout by topological features. IEEE Trans. Vis. Comput. Graph. 13(2), 17\u2013305 (2007)","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"30_CR2","unstructured":"Astanin S.V., Dragnish N.V., Zhukovsky N.K., Nested metagraphs as models of complex objects. In\u017e. vestn. Dona, 4 (2012), http:\/\/www.ivdon.ru\/magazine\/archive\/n4p2y2012\/1434"},{"issue":"4","key":"30_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical O(N log N) force-calculation algorithm. Nature 324(4), 446\u2013449 (1986)","journal-title":"Nature"},{"key":"30_CR4","series-title":"Integrated Series in Information Systems","volume-title":"Metagraph and Their Application","author":"A Basu","year":"2007","unstructured":"Basu, A., Blanning, R.W.: Metagraph and Their Application. Integrated Series in Information Systems. Springer, Berlin (2007)"},{"key":"30_CR5","volume-title":"Introduction to Algorithms (2nd ed.)","author":"TH Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill, New York (2001)"},{"key":"30_CR6","first-page":"149","volume":"42","author":"P Eades","year":"1984","unstructured":"Eades, P.: A heuristic for graph drawing. Congr. Numerantium 42, 149\u2013160 (1984)","journal-title":"Congr. Numerantium"},{"key":"30_CR7","unstructured":"Frick A., Ludwig A., Mehldau H.: A fast adaptive layout algorithm for undirected graphs. In: Proceedings of the Graph Drawing 1994. LNCS, vol. 894, pp. 389\u2013403. Springer, Berlin (1995)"},{"issue":"11","key":"30_CR8","doi-asserted-by":"publisher","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 byforce-directed placement. Softw. - Pract. Exp. 21(11), 1129\u20131164 (1991)","journal-title":"Softw. - Pract. Exp."},{"key":"30_CR9","doi-asserted-by":"crossref","unstructured":"Hachul, S., Junger, M.: Drawing Large Graphs with a Potential-Field-Based Multilevel Algorithm (Extended Abstract). In: Proceedings of the Graph Drawing 2004, pp. 285\u2013295. Springer, Berlin (2005)","DOI":"10.1007\/978-3-540-31843-9_29"},{"key":"30_CR10","doi-asserted-by":"crossref","unstructured":"Harel, D., Koren, Y.: LNCS. A Fast Multi-scale Method for Drawing Large Graphs. In: Proceedings of the Graph Drawing 2000. LNCS, pp. 183\u2013196. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44541-2_18"},{"issue":"5","key":"30_CR11","doi-asserted-by":"publisher","first-page":"741","DOI":"10.1109\/TVCG.2006.147","volume":"12","author":"D Holten","year":"2006","unstructured":"Holten, D.: Hierarchical edge bundles: visualization of adjacency relations in hierarchical data. IEEE Trans. Vis. Comput Graph. 12(5), 741\u2013748 (2006)","journal-title":"IEEE Trans. Vis. Comput Graph."},{"key":"30_CR12","doi-asserted-by":"publisher","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, 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"30_CR13","volume-title":"Procedural Elements for Computer Graphics (2nd ed.)","author":"DF Rogers","year":"1998","unstructured":"Rogers, D.F.: Procedural Elements for Computer Graphics (2nd ed.). WCB\/McGraw-Hill, New York (1998)"},{"issue":"3","key":"30_CR14","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jvlc.1995.1013","volume":"6","author":"K Sugiyama","year":"1995","unstructured":"Sugiyama, K., Misue, K.: Graph drawing by the magnetic spring model. J. Vis. Lang. Comput. 6(3), 217\u2013232 (1995)","journal-title":"J. Vis. Lang. Comput."},{"issue":"3","key":"30_CR15","doi-asserted-by":"publisher","first-page":"253","DOI":"10.7155\/jgaa.00070","volume":"7","author":"C Walshaw","year":"2003","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph drawing. J. Graph Algorithms 7(3), 253\u2013285 (2003)","journal-title":"J. Graph Algorithms"}],"container-title":["Advances in Intelligent Systems and Computing","Soft Computing in Computer and Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15147-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T10:36:23Z","timestamp":1675852583000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15147-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319151465","9783319151472"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15147-2_30","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"20 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}