{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:21Z","timestamp":1725467421654},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540612285"},{"type":"electronic","value":"9783540683889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-61228-9_104","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:17:05Z","timestamp":1153131425000},"page":"443-453","source":"Crossref","is-referenced-by-count":1,"title":["Drawing graphs with attribute graph grammars"],"prefix":"10.1007","author":[{"given":"Gaby","family":"Zin\u00dfmeister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carolyn L.","family":"McCreary","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,9,7]]},"reference":[{"key":"30_CR1","unstructured":"F.-J. Brandenburg. Graph Grammatiken. Script to a lecture, summer semester '89, 1990."},{"key":"30_CR2","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg. Layout Graph Grammars: The Placement Approach. In Ehrig et al. [8], pages 144\u2013156.","DOI":"10.1007\/BFb0017387"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"F. J. Brandenburg. The Equivalence of Boundary and Confluent Graph Grammars on Graph Languages of Bounded Degree. In R. V. Book, editor, Rewriting Techniques and Applications, 4th Int. Conf., Como, Italy, pages 312\u2013322. Springer, 1991.","DOI":"10.1007\/3-540-53904-2_106"},{"issue":"11","key":"30_CR4","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TSMC.1980.4308390","volume":"SMC-10","author":"M.-J. Carpano","year":"1980","unstructured":"M.-J. Carpano. Automatic Display of Hierarchized Graphs for Computer-Aided Decsision Analysis. IEEE Trans. on Systems, Man, and Cybernetics, SMC-10(11):705\u2013715, Nov. 1980.","journal-title":"IEEE Trans. on Systems, Man, and Cybernetics"},{"issue":"2\/3","key":"30_CR5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0304-3975(87)90102-2","volume":"55","author":"B. Courcelle","year":"1987","unstructured":"B. Courcelle. An Axiomatic Definition of Context-Free Rewriting and its Application to NLC-Graph Grammars. Theoretical Comput. Sci., 55(2\/3):141\u2013182, 1987.","journal-title":"Theoretical Comput. Sci."},{"key":"30_CR6","volume-title":"Technical report","author":"G. Battista Di","year":"1993","unstructured":"G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms For Drawing Graphs: an Annotated Bibliography. Technical report, Brown University, Providence, RI 02912-1910, USA, 1993. Avail. via anonymous ftp from http:\/\/www.wilma.cs.brown.edu, file \/pub\/gdbiblio.tex.Z."},{"issue":"3","key":"30_CR7","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0304-3975(90)90129-6","volume":"70","author":"A. Ehrenfeucht","year":"1990","unstructured":"A. Ehrenfeucht and G. Rozenberg. Theory of 2-Structures, Part I: Clans, Basic Subclasses, and Morphisms. Theoretical Comput. Sci., 70(3):277\u2013303, Feb. 1990.","journal-title":"Theoretical Comput. Sci."},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"H. Ehrig, H.-J. Kreowski, and G. Rozenberg, editors. Graph-Grammars and Their Application to Computer Science, 1990. LNCS 532. Springer, 1991.","DOI":"10.1007\/BFb0017372"},{"issue":"2","key":"30_CR9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jpdc.1993.1095","volume":"19","author":"D. H. Gill","year":"1993","unstructured":"D. H. Gill, T. J. Smith, T. E. Gerasch, J. V. Warren, C. L. McCreary, and R. E. K. Stirewalt. Spatial \u2014 Temporal Anaylsis of Program Dependence Graphs for Useful Parallelism. Journ. of Parallel and Distr. Comp., 19(2):103\u2013118, Oct. 1993.","journal-title":"Journ. of Parallel and Distr. Comp."},{"key":"30_CR10","unstructured":"M. Kaul. Syntaxanalyse von Graphen bei Pr\u00e4zedenz-Graph-Grammatiken. Technical Report MIP-8610, Univ. Passau, 1986. (Dissertation)."},{"key":"30_CR11","unstructured":"T. Lamsh\u00f6ft. Ein Parser f\u00fcr Graphgrammatiken. Master's thesis, Univ. Passau, FB Informatik, 1993."},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"U. Lichtblau. Recognizing Rooted Context-Free Flowgraph Languages In Polynomial Time. In Ehrig et al. [8], pages 538\u2013548.","DOI":"10.1007\/BFb0017411"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"C. McCreary. An Algorithm for Parsing a Graph Grammar. PhD thesis, Univ. of Colorado, 1987.","DOI":"10.1145\/322609.322649"},{"key":"30_CR14","first-page":"324","volume-title":"Specification of Diagram Editors Providing Layout Adjustment with Minimal Changes","author":"M. Minas","year":"1993","unstructured":"M. Minas and G. Viehstaedt. Specification of Diagram Editors Providing Layout Adjustment with Minimal Changes. In IEEE Workshop on Visual Languages, Bergen, Norway, pages 324\u2013329, Los Alamitos, CA, 1993. IEEE Computer Society Press."},{"issue":"4","key":"30_CR15","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/52.56447","volume":"7","author":"S. Moen","year":"1990","unstructured":"S. Moen. Drawing Dynamic Trees. IEEE Software, 7(4):21\u201328, July 1990.","journal-title":"IEEE Software"},{"issue":"2","key":"30_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1109\/TSE.1981.234519","volume":"SE-7","author":"E. M. Reingold","year":"1981","unstructured":"E. M. Reingold and J. S. Tilford. Tidier Drawings of Trees. IEEE Trans. Softw. Eng., SE-7(2):223\u2013228, Mar. 1981.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"30_CR17","volume-title":"Reihe Informatik","author":"A. Sch\u00fctte","year":"1987","unstructured":"A. Sch\u00fctte. Spezifikation und Generierung von \u00dcbersetzern f\u00fcr Graph-Sprachen durch attributierte Graph-Grammatiken. Reihe Informatik. EXpress Edition, Berlin, 1987. (Dissertation)."},{"key":"30_CR18","unstructured":"J. D. Ullman. Computational Aspects of VLSI, chapter 3 Layout Algorithms, pages 80\u2013130. Computer Science Press, 1984."},{"issue":"2","key":"30_CR19","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1137\/0211023","volume":"11","author":"J. Valdes","year":"1982","unstructured":"J. Valdes, R. E. Tarjan, and E. L. Lawler. The Recognition of Series Parallel Digraphs. SIAM J. Computation, 11(2):298\u2013313, 1982.","journal-title":"SIAM J. Computation"},{"key":"30_CR20","unstructured":"G. Zin\u00dfmeister. Tree Layout by Attribute Graph Grammars. WSI-Fachbericht WSI-93-4, Univ. T\u00fcbingen, Wilhelm-Schickard-Institut, 1993."}],"container-title":["Lecture Notes in Computer Science","Graph Grammars and Their Application to Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-61228-9_104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:02:17Z","timestamp":1555711337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-61228-9_104"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540612285","9783540683889"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-61228-9_104","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}