乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,4]],"date-time":"2024-01-04T08:00:48Z","timestamp":1704355248429},"reference-count":34,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2000,7,1]],"date-time":"2000-07-01T00:00:00Z","timestamp":962409600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4764,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2000,7]]},"DOI":"10.1016\/s0166-218x(00)00172-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:56:52Z","timestamp":1027605412000},"page":"55-87","source":"Crossref","is-referenced-by-count":28,"title":["Three-dimensional orthogonal graph drawing algorithms"],"prefix":"10.1016","volume":"103","author":[{"given":"Peter","family":"Eades","sequence":"first","affiliation":[]},{"given":"Antonios","family":"Symvonis","sequence":"additional","affiliation":[]},{"given":"Sue","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00172-4_BIB1","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB2","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(87)90173-6","article-title":"The Complexity of Minimizing Wire Lengths in VLSI Layouts","volume":"25","author":"Bhatt","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB3","unstructured":"T. Biedl, Embedding Nonplanar Graphs in the Rectangular Grid, Rutcor Research Report 27-93, 1993."},{"issue":"3","key":"10.1016\/S0166-218X(00)00172-4_BIB4","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0925-7721(97)00026-6","article-title":"A better heuristic for orthogonal graph drawings","volume":"9","author":"Biedl","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB5","unstructured":"T. Biedl, New lower bounds for orthogonal graph drawings, Graph Drawing, Lecture Notes in Computer Science, Vol. 1027, Springer, Berlin, 1995, pp. 28\u201339."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB6","unstructured":"T. Biedl, T. Shermer, S. Whitesides, S. Wismath, Orthogonal 3D graph drawing, in: GD97, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1998, 76\u201386."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB7","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB8","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0925-7721(94)00014-X","article-title":"Algorithms for drawing graphs: an annotated bibliography","volume":"4","author":"DiBattista","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB9","unstructured":"D. Dolev, F.T. Leighton, H. Trickey, Planar Embeddings of Planar Graphs, in: F.P. Preparata (Ed.), Advances in Computing Research 2, JAI Press Inc., Greenwich CT, USA, 1984, pp. 147\u2013161."},{"issue":"2","key":"10.1016\/S0166-218X(00)00172-4_BIB10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0020-0190(96)00133-0","article-title":"The techniques of Komolgorov and Barzdin for three dimensional orthogonal graph drawings","volume":"60","author":"Eades","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB11","series-title":"GD96","first-page":"139","article-title":"Two algorithms for three dimensional orthogonal graph drawing","volume":"Vol. 1190","author":"Eades","year":"1996"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB12","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB13","unstructured":"S. Even, G. Granot, Rectilinear Planar Drawings with Few Bends in Each Edge, Technical Report 797, Computer Science Department, Technion, 1994."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB14","doi-asserted-by":"crossref","unstructured":"M. Formann, F. Wagner, The VLSI layout problem in various embedding models, in: WG91, Lecture Notes in Computer Science, Vol. 484, Springer, Berlin, 1991, 130\u2013139.","DOI":"10.1007\/3-540-53832-1_38"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB15","doi-asserted-by":"crossref","unstructured":"A. Garg, R. Tamassia, On the computational complexity of upward and rectilinear planarity testing, Proceedings of the Graph Drawing: DIMACS International Workshop (GD\u201994), Lecture Notes in Computer Science, Vol. 894, Springer, Berlin, 1995, pp. 286\u2013297.","DOI":"10.1007\/3-540-58950-3_384"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","article-title":"On representation of subsets","volume":"10","author":"Hall","year":"1935","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB17","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","article-title":"Worst-case Performance Bounds for Simple One-dimensional Packing Algorithms","volume":"3","author":"Johnson","year":"1974","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0166-218X(00)00172-4_BIB18","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/BF02086606","article-title":"Drawing planar graphs using the canonical ordering","volume":"16","author":"Kant","year":"1996","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB19","first-page":"261","article-title":"About realisation of sets in 3-dimensional space","author":"Kolmogorov","year":"1967","journal-title":"Problems Cybernet."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB20","unstructured":"M. Kramer, J. van Leeuwen, The complexity of wire routing and finding minimum area layouts for arbitrary VLSI circuits, in: F. Preparata (Ed.), Advances in Computing Research, Vol. 2 (VLSI Theory), 1984, 129\u2013146."},{"issue":"1-2","key":"10.1016\/S0166-218X(00)00172-4_BIB21","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0925-7721(97)00017-5","article-title":"Algorithms for area-efficient orthogonal drawings","volume":"9","author":"Papakostas","year":"1998","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB22","unstructured":"A. Papakostas, I. Tollis, Incremental orthogonal graph drawing in three dimensions, in: GD97, Lecture Notes in Computer Science, Vol. 1353, Springer, Berlin, 1998, pp. 52\u201363."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02392606","article-title":"Die theorie der regul\u00e4ren graphen","volume":"15","author":"Petersen","year":"1891","journal-title":"Acta Math."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01744565","article-title":"Optimal three-dimensional VLSI layouts","volume":"16","author":"Preparata","year":"1983","journal-title":"Math. Systems Theory"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB25","doi-asserted-by":"crossref","unstructured":"A.L. Rosenberg, Three-dimensional integrated circuitry, in: Kung, Sproule, Steele (Eds.), VLSI Systems and Computations, Computer Science Press, 1981, pp. 69\u201380.","DOI":"10.1007\/978-3-642-68402-9_9"},{"issue":"3","key":"10.1016\/S0166-218X(00)00172-4_BIB26","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1145\/2402.322384","article-title":"Three-dimensional VLSI: a case study","volume":"30","author":"L. Rosenberg","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB27","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(94)00020-E","article-title":"Drawing graphs on rectangular grids","volume":"63","author":"Sch\u00e4ffter","year":"1995","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10.1016\/S0166-218X(00)00172-4_BIB28","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1137\/S0097539796299266","article-title":"Bipartite edge-coloring in O(\u0394 m) time","volume":"28","author":"Schrijver","year":"1998","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB29","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/net.3230140202","article-title":"On minimal node-cost planar embeddings","volume":"14","author":"Storer","year":"1984","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0166-218X(00)00172-4_BIB30","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0216030","article-title":"On embedding a graph in the grid with a minimum number of bends","volume":"16","author":"Tamassia","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB31","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02187705","article-title":"A unified approach to visibility representations of planar graphs","volume":"1","author":"Tamassia","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0166-218X(00)00172-4_BIB32","first-page":"495","article-title":"Efficient embeddings of planar graphs in linear time","author":"Tamassia","year":"1987","journal-title":"IEEE Symposium on Circuits and Systems"},{"issue":"9","key":"10.1016\/S0166-218X(00)00172-4_BIB33","doi-asserted-by":"crossref","first-page":"1230","DOI":"10.1109\/31.34669","article-title":"Planar grid embedding in linear time","volume":"Vol. 36","author":"Tamassia","year":"1989","journal-title":"IEEE Trans. Circuits and Systems"},{"key":"10.1016\/S0166-218X(00)00172-4_BIB34","unstructured":"D. Wood, On higher-dimensional orthogonal graph drawing, Proceedings of CATS\u201997, Computing: The Australasian Theory Symposium, February 1997, Sydney, Australia, pp. 3\u20138."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001724?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00001724?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T21:18:29Z","timestamp":1578518309000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00001724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,7]]},"references-count":34,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2000,7]]}},"alternative-id":["S0166218X00001724"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00172-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2000,7]]}}}