{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:21:07Z","timestamp":1762917667396,"version":"3.37.3"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100005446","name":"Data Integration and Analysis System","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005446","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Visual. Comput. Graphics"],"published-print":{"date-parts":[[2016,6,1]]},"DOI":"10.1109\/tvcg.2016.2534519","type":"journal-article","created":{"date-parts":[[2016,2,29]],"date-time":"2016-02-29T14:23:45Z","timestamp":1456755825000},"page":"1652-1661","source":"Crossref","is-referenced-by-count":9,"title":["Minimizing the Number of Edges via Edge Concentration in Dense Layered Graphs"],"prefix":"10.1109","volume":"22","author":[{"given":"Yosuke","family":"Onoue","sequence":"first","affiliation":[]},{"given":"Nobuyuki","family":"Kukimoto","sequence":"additional","affiliation":[]},{"given":"Naohisa","family":"Sakamoto","sequence":"additional","affiliation":[]},{"given":"Koji","family":"Koyamada","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2006.11.045"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2014.2346753"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1880022.1880030"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1377836.1377838"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45848-4_3"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gks1107"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1977.4309760"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2133803.2330084"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00397-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/73337.73350"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0925-7721(94)00014-X"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380201307"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(99)00207-3"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-0159-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24595-7_1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2005.60"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-2647(06)80110-3"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","article-title":"An efficient algorithm for enumerating closed patterns in transaction databases","volume":"3245","author":"uno","year":"2004","journal-title":"Science Discovery"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/smr.270"},{"key":"ref6","first-page":"97","article-title":"Layout of Bayesian networks","author":"marriott","year":"0","journal-title":"Proc 28th Australasian Comput Sci Conf"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/KES.1998.725871"},{"key":"ref8","first-page":"199","article-title":"How people read sociograms: A questionnaire study","author":"huang","year":"2006","journal-title":"Proc Asia-Pacific Symp Inform Vis"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/APVIS.2007.329282"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44969-8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1016344215610"},{"key":"ref1","first-page":"409","article-title":"Hierarchical drawing algorithms","author":"healy","year":"2013","journal-title":"Handbook of Graph Drawing and Visualization"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2008.135"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.6028\/jres.084.024"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8659.2009.01450.x"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2006.147"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2015.2467813"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-18469-7_30"}],"container-title":["IEEE Transactions on Visualization and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/2945\/7462315\/07422136.pdf?arnumber=7422136","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:44:17Z","timestamp":1641987857000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7422136\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,1]]},"references-count":37,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tvcg.2016.2534519","relation":{},"ISSN":["1077-2626"],"issn-type":[{"type":"print","value":"1077-2626"}],"subject":[],"published":{"date-parts":[[2016,6,1]]}}}