{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:44:15Z","timestamp":1777398255932,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,4,1]],"date-time":"1989-04-01T00:00:00Z","timestamp":607392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1989,4]]},"DOI":"10.1016\/0020-0190(89)90102-6","type":"journal-article","created":{"date-parts":[[2003,4,25]],"date-time":"2003-04-25T01:23:41Z","timestamp":1051233821000},"page":"7-15","source":"Crossref","is-referenced-by-count":1933,"title":["An algorithm for drawing general undirected graphs"],"prefix":"10.1016","volume":"31","author":[{"given":"Tomihisa","family":"Kamada","sequence":"first","affiliation":[]},{"given":"Satoru","family":"Kawai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90102-6_BIB1","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1109\/TSE.1986.6312901","article-title":"A layout algorithm for data flow diagrams","volume":"SE-12","author":"Batini","year":"1986","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0020-0190(89)90102-6_BIB2","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1137\/0216061","article-title":"On the optimal layout of planar graphs with fixed boundary","volume":"16","author":"Becker","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90102-6_BIB3","series-title":"Graphs & Diagraphs","author":"Behzad","year":"1979"},{"key":"10.1016\/0020-0190(89)90102-6_BIB4","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","article-title":"Automatic display of hierarchized graphs for computer-aided decision analysis","volume":"SMC-10","author":"Carpano","year":"1980","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"10.1016\/0020-0190(89)90102-6_BIB5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/321556.321562","article-title":"An efficient algorithm for graph isomorphism","volume":"17","author":"Corneil","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(89)90102-6_BIB6","first-page":"149","article-title":"A heuristics for graph drawing","volume":"42","author":"Eades","year":"1984","journal-title":"Congr. Numer."},{"key":"10.1016\/0020-0190(89)90102-6_BIB7","series-title":"Technical Rep. No. 82","article-title":"Algorithms for drawing graphs: An annotated bibliography","author":"Eades","year":"1987"},{"key":"10.1016\/0020-0190(89)90102-6_BIB8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","article-title":"Algorithm 97: shortest path","volume":"5","author":"Floyd","year":"1962","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(89)90102-6_BIB9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/S0022-0000(73)80013-3","article-title":"A V log V algorithm for isomorphism of triconnected of planar graphs","volume":"7","author":"Hopcroft","year":"1973","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0020-0190(89)90102-6_BIB10","series-title":"Technical Rep. No. 88-7","article-title":"Automatic display of network structures for human understanding","author":"Kamada","year":"1988"},{"key":"10.1016\/0020-0190(89)90102-6_BIB11","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/323233.323254","article-title":"A method for drawing graphs","author":"Lipton","year":"1985","journal-title":"Proc. ACM Symposium on Computational Geometry"},{"key":"10.1016\/0020-0190(89)90102-6_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0020-0190(88)90037-3","article-title":"A fast backtrack algorithm for graph isomorphism","volume":"29","author":"Mittal","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(89)90102-6_BIB13","first-page":"101","article-title":"An all pairs shortest path algorithm with expected running time O(n2log n)","author":"Moffat","year":"1985","journal-title":"Proc. Conf. Found. Comp. Sci."},{"key":"10.1016\/0020-0190(89)90102-6_BIB14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1002\/spe.4380170107","article-title":"A browser for directed graphs","volume":"17","author":"Rowe","year":"1987","journal-title":"Software Pract. Exper."},{"key":"10.1016\/0020-0190(89)90102-6_BIB15","series-title":"Algorithms","author":"Sedgewick","year":"1983"},{"key":"10.1016\/0020-0190(89)90102-6_BIB16","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0202004","article-title":"A new algorithm for finding all shortest paths in a graph of positive arcs in average time O(n2log2n)","volume":"2","author":"Spira","year":"1973","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(89)90102-6_BIB17","series-title":"Research Rep. No. 58","article-title":"Achieving uniqueness requirement in drawing digraphs: optimum code algorithm and hierarchy isomorphism","author":"Sugiyama","year":"1985"},{"key":"10.1016\/0020-0190(89)90102-6_BIB18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","article-title":"Methods for visual understanding of hierarchical system structures","volume":"SMC-11","author":"Sugiyama","year":"1981","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"key":"10.1016\/0020-0190(89)90102-6_BIB19","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/21.87055","article-title":"Automatic graph drawing and readability of diagrams","volume":"SMC-18","author":"Tamassia","year":"1988","journal-title":"IEEE Trans. Syst. Man, Cybern."},{"key":"10.1016\/0020-0190(89)90102-6_BIB20","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1112\/plms\/s3-13.1.743","article-title":"How to draw a graph","volume":"3","author":"Tutte","year":"1963","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0020-0190(89)90102-6_BIB21","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TSMC.1977.4309760","article-title":"Crossing theory and hierarchy mapping","volume":"SMC-7","author":"Warfield","year":"1977","journal-title":"IEEE Trans. Syst. Man, Cybern."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T21:56:06Z","timestamp":1553205366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,4]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,4]]}},"alternative-id":["0020019089901026"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90102-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,4]]}}}