{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,4]],"date-time":"2022-12-04T06:06:05Z","timestamp":1670133965326},"reference-count":14,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. &amp; Syst."],"published-print":{"date-parts":[[2022,12,1]]},"DOI":"10.1587\/transinf.2022edl8050","type":"journal-article","created":{"date-parts":[[2022,11,30]],"date-time":"2022-11-30T22:18:26Z","timestamp":1669846706000},"page":"2135-2138","source":"Crossref","is-referenced-by-count":0,"title":["GRAPHULY: GRAPH U-Nets-Based Multi-Level Graph LaYout"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Kai","family":"YAN","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]},{"given":"Tiejun","family":"ZHAO","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]},{"given":"Muyun","family":"YANG","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Harbin Institute of Technology"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] B. Lee, C. Plaisant, C.S. Parr, J.-D. Fekete, and N. Henry, \u201cTask taxonomy for graph visualization,\u201d Proc. 2006 AVI Workshop on BEyond Time and Errors: Novel Evaluation Methods for Information Visualization, pp.1-5, 2006. 10.1145\/1168149.1168168","DOI":"10.1145\/1168149.1168168"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] K. Yan and W. Cui, \u201cVisualizing the uncertainty induced by graph layout algorithms,\u201d 2017 IEEE Pacific Visualization Symposium (PacificVis), pp.200-209, IEEE, 2017. 10.1109\/pacificvis.2017.8031595","DOI":"10.1109\/PACIFICVIS.2017.8031595"},{"key":"3","unstructured":"[3] Y.Y. Leow, T. Laurent, and X. Bresson, \u201cGraphTSNE: A visualization technique for graph-structured data,\u201d ICLR Workshop on Representation Learning on Graphs and Manifolds, 2019."},{"key":"4","doi-asserted-by":"crossref","unstructured":"[4] Y. Wang, Z. Jin, Q. Wang, W. Cui, T. Ma, and H. Qu, \u201cDeepDrawing: A deep learning approach to graph drawing,\u201d IEEE Trans. Vis. Comput. Graph., vol.26, no.1, pp.676-686, 2019. 10.1109\/tvcg.2019.2934798","DOI":"10.1109\/TVCG.2019.2934798"},{"key":"5","doi-asserted-by":"publisher","unstructured":"[5] X. Wang, K. Yen, Y. Hu, and H.-W. Shen, \u201cDeepGD: A deep learning framework for graph drawing using GNN,\u201d IEEE Comput. Graph. Appl., vol.41, no.5, pp.32-44, 2021. 10.1109\/mcg.2021.3093908","DOI":"10.1109\/MCG.2021.3093908"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[6] L. Giovannangeli, F. Lalanne, D. Auber, R. Giot, and R. Bourqui, \u201cDeep neural network for DrawiNg networks, (DNN)<sup>2<\/sup>,\u201d arXiv: 2108.03632 [cs], Aug. 2021.","DOI":"10.1007\/978-3-030-92931-2_27"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[7] M. Tiezzi, G. Ciravegna, and M. Gori, \u201cGraph neural networks for graph drawing,\u201d IEEE Trans. Neural Netw. Learn. Syst. (Early Access), pp.1-14, June 2022. 10.1109\/TNNLS.2022.3184967","DOI":"10.1109\/TNNLS.2022.3184967"},{"key":"8","unstructured":"[8] H. Gao and S. Ji, \u201cGraph u-nets,\u201d International Conference on Machine Learning, pp.2083-2092, PMLR, 2019."},{"key":"9","doi-asserted-by":"crossref","unstructured":"[9] P. Gajer and S.G. Kobourov, \u201cGrip: Graph dRawing with intelligent placement,\u201d International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol.1984, pp.222-228, Springer, 2000. 10.1007\/3-540-44541-2_21","DOI":"10.1007\/3-540-44541-2_21"},{"key":"10","unstructured":"[10] D. Kreuzer, D. Beaini, W. Hamilton, V. L\u00e9tourneau, and P. Tossou, \u201cRethinking graph transformers with spectral attention,\u201d Advances in Neural Information Processing Systems, vol.34, 2021."},{"key":"11","doi-asserted-by":"publisher","unstructured":"[11] T. Kamada and S. Kawai, \u201cAn algorithm for drawing general undirected graphs,\u201d Information Processing Letters, vol.31, no.1, pp.7-15, 1989. 10.1016\/0020-0190(89)90102-6","DOI":"10.1016\/0020-0190(89)90102-6"},{"key":"12","unstructured":"[12] T.N. Kipf and M. Welling, \u201cSemi-supervised classification with graph convolutional networks,\u201d arXiv preprint arXiv:1609.02907, 2016."},{"key":"13","unstructured":"[13] P. Veli\u010dkovi\u0107, G. Cucurull, A. Casanova, A. Romero, P. Lio, and Y. Bengio, \u201cGraph attention networks,\u201d arXiv preprint arXiv:1710. 10903, 2017."},{"key":"14","doi-asserted-by":"crossref","unstructured":"[14] S. Hachul and M. J\u00fcnger, \u201cDrawing large graphs with a potential-field-based multilevel algorithm,\u201d International Symposium on Graph Drawing, Lecture Notes in Computer Science, vol.3383, pp.285-295, Springer, 2005. 10.1007\/978-3-540-31843-9_29","DOI":"10.1007\/978-3-540-31843-9_29"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/12\/E105.D_2022EDL8050\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,3]],"date-time":"2022-12-03T04:10:30Z","timestamp":1670040630000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/12\/E105.D_2022EDL8050\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,1]]},"references-count":14,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2022edl8050","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"value":"0916-8532","type":"print"},{"value":"1745-1361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,1]]},"article-number":"2022EDL8050"}}