{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T21:05:04Z","timestamp":1761944704522,"version":"build-2065373602"},"publisher-location":"Berlin\/Heidelberg","reference-count":22,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387968180"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0040384","type":"book-chapter","created":{"date-parts":[[2006,8,3]],"date-time":"2006-08-03T00:03:50Z","timestamp":1154563430000},"page":"160-169","source":"Crossref","is-referenced-by-count":14,"title":["Graph embeddings 1988: Recent breakthroughs, new directions"],"prefix":"10.1007","author":[{"given":"Arnold L.","family":"Rosenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"F. Annexstein, M. Baumslag, A.L. Rosenberg (1987): Group-action graphs and parallel architectures. Submitted for publication."},{"key":"17_CR2","unstructured":"F. Berman (1983): Parallel computation with limited resources. Johns Hopkins Conf. on Information Sciences and Systems."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/0095-8956(79)90021-2","volume":"27","author":"F. Bernhart","year":"1979","unstructured":"F. Bernhart and P.C. Kainen (1979): The book thickness of a graph. J. Comb. Th. (B) 27, 320\u2013331.","journal-title":"J. Comb. Th. (B)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"S.N. Bhatt and J.-Y. Cai (1987): Take a walk, grow a tree. Typescript, Yale Univ.","DOI":"10.1109\/SFCS.1988.21963"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"S.N. Bhatt, F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1986): Optimal simulations of tree machines. 27th IEEE Symp. on Foundations of Computer Science, 274\u2013282.","DOI":"10.1109\/SFCS.1986.38"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"S.N. Bhatt, F.R.K. Chung, J.-W. Hong, F.T. Leighton, A.L. Rosenberg (1988): Optimal simulations by Butterfly networks. 20th ACM Symp. on Theory of Computing, to appear.","DOI":"10.21236\/ADA200780"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0608002","volume":"8","author":"F.R.K. Chung","year":"1987","unstructured":"F.R.K. Chung, F.T. Leighton, A.L. Rosenberg (1987): Embedding graphs in books: A layout problem with applications to VLSI design. SIAM J. Algebr. Discr. Meth. 8, 33\u201358.","journal-title":"SIAM J. Algebr. Discr. Meth."},{"key":"17_CR8","unstructured":"M.R. Fellows (1985): Encoding graphs in graphs. Ph.D. Dissertation, Univ. California at San Diego."},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"J. Friedman and N. Pippenger (1986): Expanding graphs contain all small trees: Typescript, IBM Almaden Research Center.","DOI":"10.1007\/BF02579202"},{"key":"17_CR10","unstructured":"D.S. Greenberg (1987): Minimum expansion embeddings of meshes in hypercubes. Tech. Rpt. DCS\/RR-535, Yale Univ."},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1145\/1634.2377","volume":"31","author":"J.W. Greene","year":"1984","unstructured":"J.W. Greene and A. El Gamal (1984): Configuration of VLSI arrays in the presence of defects. J. ACM 31, 694\u2013717.","journal-title":"J. ACM"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"A.K. Gupta and S.E. Hambrusch (1988): Embedding large tree machines into small ones. MIT Conf. on Advanced Research in VLSI.","DOI":"10.7551\/mitpress\/1102.003.0015"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"J. Hastad, F.T. Leighton, M. Newman (1987): Reconfiguring a hypercube in the presence of faults. 19th ACM Symp. on theory of Computing.","DOI":"10.1145\/28395.28425"},{"key":"17_CR14","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1137\/0608018","volume":"8","author":"L.S. Heath","year":"1987","unstructured":"L.S. Heath (1987): Embedding outerplanar graphs in small books. SIAM J. Algebr. Discr. Meth. 8, 198\u2013218.","journal-title":"SIAM J. Algebr. Discr. Meth."},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"L.S. Heath and S. Istrail (1987): The pagenumber of genus g graphs is O(g). 19th, ACM Symp. on Theory of Computing.","DOI":"10.1145\/28395.28437"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"L.S. Heath, A.L. Rosenberg, B.T. Smith (1988): The physical mapping problem for parallel architectures. J. ACM, to appear.","DOI":"10.1145\/44483.44489"},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1145\/2157.322401","volume":"30","author":"J.-W. Hong","year":"1983","unstructured":"J.-W. Hong, K. Mehlhorn, A.L. Rosenberg (1983): Cost tradeoffs in graph embeddings. J. ACM 30, 709\u2013728.","journal-title":"J. ACM"},{"key":"17_CR18","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/TC.1985.1676584","volume":"C-34","author":"F.T. Leighton","year":"1985","unstructured":"F.T. Leighton and C.E. Leiserson (1985): Wafer-scale integration of systolic arrays. IEEE Trans. Comp., C-34, 448\u2013461.","journal-title":"IEEE Trans. Comp."},{"key":"17_CR19","unstructured":"S.M. Malitz (1988): Embedding graphs in small books. Manuscript, MIT."},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F.P. Preparata","year":"1981","unstructured":"F.P. Preparata and J.E. Vuillemin (1981): The cube-connected cycles: a versatile network for parallel computation. C. ACM 24, 300\u2013309.","journal-title":"C. ACM"},{"key":"17_CR21","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TC.1983.1676134","volume":"C-32","author":"A.L. Rosenberg","year":"1983","unstructured":"A.L. Rosenberg (1983): The Diogenes approach to testable fault-tolerant arrays of processors. IEEE Trans. Comp., C-32, 902\u2013910.","journal-title":"IEEE Trans. Comp."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"M. Yannakakis (1986): Four pages are necessary and sufficient for planar graphs. 18th ACM Symp. on Theory of Computing, 104\u2013108.","DOI":"10.1145\/12130.12141"}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0040384.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T09:16:52Z","timestamp":1736500612000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0040384"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387968180"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0040384","relation":{},"subject":[]}}