{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T16:05:47Z","timestamp":1725638747538},"publisher-location":"London","reference-count":18,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9783540761709"},{"type":"electronic","value":"9781447115250"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/978-1-4471-1525-0_14","type":"book-chapter","created":{"date-parts":[[2011,12,5]],"date-time":"2011-12-05T02:49:16Z","timestamp":1323053356000},"page":"157-167","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Drawing of Structured Digraphs"],"prefix":"10.1007","author":[{"given":"Hui","family":"Yao","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"G.D. Battista, P. Eadess, R. Tamassia, and I.G. Tollis, \u201cAlgorithms for Drawing Graphs: an Annotated Bibliography,\u201d available via anonymous ftp from (128.148.33.66), files"},{"key":"14_CR2","unstructured":"T. Catarci, \u201cThe Assignment Heuristic for Crossing Reduction in Bipartite Graphs,\u201d Proc. of the 26th Allerton Conference, 1988."},{"issue":"3","key":"14_CR3","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/21.364865","volume":"25","author":"T Catarci","year":"1995","unstructured":"T. Catarci, \u201cThe Assignment Heuristic for Crossing Reduction,\u201d IEEE Trans, on Systems, Man, and Cybernetics, Vol. 25, No. 3, pp. 515\u2013521, March 1995.","journal-title":"IEEE Trans, on Systems, Man, and Cybernetics"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"E.G. Coffinan, Jr and R. L. Graham, \u201cOptimal Scheduling for Two- processor Systems, \u201d Acto Informatica 1, pp. 200\u2013213, 1972","DOI":"10.1007\/BF00288685"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"S. Dresbach, \u201cA New Heuristic Layout Algorithm for Directed Acyclic Graphs,\u201d to appear in U. Derigs, A. Bachem, and A Drexl (Eds): \u201cOperatons Research Proceedings 1994,\u201d Berlin, Springer 1995, 121\u2013126.","DOI":"10.1007\/978-3-642-79459-9_23"},{"issue":"4","key":"14_CR6","first-page":"424","volume":"13","author":"P Eades","year":"1990","unstructured":"P. Eades and K. Sugiyama, \u201cHow to Draw a Directed Graph,\u201d Invited survey paper, Journal of Information Processing, Vol. 13, No. 4, pp. 424\u2013437, 1990","journal-title":"Invited survey paper, Journal of Information Processing"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01187020","volume":"11","author":"P Eades","year":"1994","unstructured":"P. Eades and N.C. Wormald, \u201cEdge Crossings in Drawings of Bipartite Graphs,\u201d Algorithmica, (1994) 11: pp. 379\u2013403.","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"E. R. Gansner, E. Koustsofios, S. C. North and K. P. VO, \u201cA Technique for Drawing Directed Graphs,\u201d IEEE Trans, on Software engineering, Vol. 19, No. 3, pp. 214\u2013230, 1993.","DOI":"10.1109\/32.221135"},{"key":"14_CR9","volume-title":"Freeman","author":"MR Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, \u201cComputers and Intractability-A Guide to the Theory of NP-Completeness,\u201d Freeman, 1979."},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1137\/0604033","volume":"4","author":"MR Garey","year":"1983","unstructured":"M.R. Garey and D.S. Johnson, \u201cCrossing Number is NP-Complete,\u201d SIAM J. of Algebraic and Discrete Methods, Vol. 4, No. 3, pp. 312\u2013316, 1983.","journal-title":"SIAM J. of Algebraic and Discrete Methods"},{"key":"14_CR11","unstructured":"James Martin Associates PLC., \u201cInformation Strategy Planning Handbook,\u201d Ireland, 1987."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, \u201cGraph algorithms and NP-Completeness,\u201d Springer Verlag, 1984.","DOI":"10.1007\/978-3-642-69897-2_3"},{"key":"14_CR13","first-page":"198","volume":"07632","author":"J Rumbaugh","year":"1991","unstructured":"J. Rumbaugh, M. Blaha, W. Premerlani, F. Eddy, W. Lorensen, \u201cObject- Oriented Modeling and Design,\u201d Prentice Hall, Englewood Cliffs, New Jersey 07632, pp. 198\u2013201, 1991.","journal-title":"Prentice Hall, Englewood Cliffs, New Jersey"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"M. P. Papazoglou, \u201cUnraveling the semantics of conceptual schemas\u201d Trans, of ACM, Vol. 38, No. 9, Sept. 1995.","DOI":"10.1145\/223248.223275"},{"key":"14_CR15","unstructured":"Data research institute. (Japanese), \u201cDOA seminar,\u201d 1993."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/TSMC.1981.4308636","volume":"2","author":"K Sugiyama","year":"1981","unstructured":"K. Sugiyama, S. Tamagawa, and M. Toda, \u201cMethods for Visual Understanding of Hierarchical System Structures\u201d, IEEE Trans. On Systems, Man, and Cybernetics, Vol. SMC-11, No. 2, pp. 109\u2013125, Feb. 1981.","journal-title":"IEEE Trans. On Systems, Man, and Cybernetics, Vol. SMC-11"},{"key":"14_CR17","volume-title":"doctoral dissertation, Doctoral Program in Socio-Economic Planning, University of Tsukuba, Tsukuba city","author":"H Yao","year":"1996","unstructured":"Hui Yao,, \u201cSchema Diagram with Engineering Precision,\u201d doctoral dissertation, Doctoral Program in Socio-Economic Planning, University of Tsukuba, Tsukuba city, 305 Japan, Oct, 1996."},{"key":"14_CR18","unstructured":"Hui Yao: \u201cAn approach for the generation of standardized structured large schema diagram,\u201d to appear in Chinese Journal of Automation."}],"container-title":["OOIS\u201997"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-1525-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T05:47:25Z","timestamp":1605678445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4471-1525-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540761709","9781447115250"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-1525-0_14","relation":{},"subject":[],"published":{"date-parts":[[1998]]}}}