{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:30Z","timestamp":1725534090504},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_17","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T05:17:47Z","timestamp":1245388667000},"page":"153-162","source":"Crossref","is-referenced-by-count":0,"title":["Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs"],"prefix":"10.1007","author":[{"given":"Mohammad Khairul","family":"Hasan","sequence":"first","affiliation":[]},{"given":"Sung-Eui","family":"Yoon","sequence":"additional","affiliation":[]},{"given":"Kyung-Yong","family":"Chwa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"886","DOI":"10.1145\/1073204.1073278","volume":"24","author":"S.E. Yoon","year":"2005","unstructured":"Yoon, S.E., Lindstrom, P., Pascucci, V., Manocha, D.: Cache-Oblivious Mesh Layouts. ACM Transactions on Graphics (SIGGRAPH)\u00a024(3), 886\u2013893 (2005)","journal-title":"ACM Transactions on Graphics (SIGGRAPH)"},{"key":"17_CR2","unstructured":"Eubank, S., Kumar, V.S.A., Marathe, M.V., Srinivasan, A., Wang, N.: Structural and algorithmic aspects of massive social networks. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, pp. 718\u2013727 (2004)"},{"key":"17_CR3","volume-title":"Computer Architecture, A Quantitative Approach","author":"J.L. Hennessy","year":"2007","unstructured":"Hennessy, J.L., Patterson, D.A., Goldberg, D.: Computer Architecture, A Quantitative Approach. Morgan Kaufmann, San Francisco (2007)"},{"issue":"5","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1213","DOI":"10.1109\/TVCG.2006.162","volume":"12","author":"S.E. Yoon","year":"2006","unstructured":"Yoon, S.E., Lindstrom, P.: Mesh layouts for block-based caches. IEEE Transactions on Visualization and Computer Graphics (Proceedings Visualization)\u00a012(5), 1213\u20131220 (2006)","journal-title":"IEEE Transactions on Visualization and Computer Graphics (Proceedings Visualization)"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/800119.803884","volume-title":"STOC 1974: Proceedings of the sixth annual ACM symposium on Theory of computing","author":"M.R. Garey","year":"1974","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete problems. In: STOC 1974: Proceedings of the sixth annual ACM symposium on Theory of computing, pp. 47\u201363. ACM, New York (1974)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem\u00a016(3), 263\u2013270 (1976)","DOI":"10.1007\/BF02280884"},{"key":"17_CR7","unstructured":"Gavril, F.: Some np-complete problems on graphs. In: 11th Conference on Information Science and Systems, pp. 91\u201395 (1977)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Hansen, M.: Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: 30th Annual Symposium on Foundations of Computer Science, October-November 1, 1989, pp. 604\u2013609 (1989)","DOI":"10.1109\/SFCS.1989.63542"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ipl.2006.07.009","volume":"101","author":"U. Feige","year":"2007","unstructured":"Feige, U., Lee, J.R.: An improved approximation ratio for the minimum linear arrangement problem. Inf. Process. Lett.\u00a0101(1), 26\u201329 (2007)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"17_CR10","first-page":"553","volume":"81","author":"M.K. Goldberg","year":"1976","unstructured":"Goldberg, M.K., Klipker, I.A.: An algorithm for minimal numeration of tree vertices. Sakharth. SSR Mecn. Akad. Moambe\u00a081(3), 553\u2013556 (1976) (in Russian)","journal-title":"Sakharth. SSR Mecn. Akad. Moambe"},{"issue":"70","key":"17_CR11","first-page":"21","volume":"1","author":"D.O. Muradyan","year":"1980","unstructured":"Muradyan, D.O., Piliposyan, T.E.: Minimal numberings of a rectangular lattice. Akad. Nauk. Armyan. SRR\u00a01(70), 21\u201327 (1980) (in Russian)","journal-title":"Akad. Nauk. Armyan. SRR"},{"issue":"3","key":"17_CR12","first-page":"477","volume":"34","author":"M.R. Garey","year":"1978","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization\u00a034(3), 477\u2013495 (1978)","journal-title":"Complexity results for bandwidth minimization"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"2001","DOI":"10.1006\/jagm.2000.1149","volume":"39","author":"J. D\u00edaz","year":"2001","unstructured":"D\u00edaz, J., Penrose, M.D., Petit, J., Serna, M.: Approximating layout problems on random geometric graphs. Journal of Algorithms\u00a039 (2001)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"17_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv.\u00a034(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv."},{"key":"17_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0871-6","volume-title":"Space-Filling Curves","author":"H. Sagan","year":"1994","unstructured":"Sagan, H.: Space-Filling Curves. Springer, Heidelberg (1994)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Velho, L., de Miranda Gomes, J.: Digital halftoning with space filling curves. In: ACM SIGGRAPH, pp. 81\u201390 (1991)","DOI":"10.1145\/122718.122727"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Lindstrom, P., Pascucci, V.: Visualization of large terrains made easy. IEEE Visualization, 363\u2013370 (2001)","DOI":"10.1109\/VISUAL.2001.964533"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Pascucci, V., Frank, R.J.: Global static indexing for real-time exploration of very large regular grids. In: Supercomputing (2001)","DOI":"10.1145\/582034.582036"},{"issue":"5","key":"17_CR19","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/83.499920","volume":"5","author":"C. Gotsman","year":"1996","unstructured":"Gotsman, C., Lindenbaum, M.: On the metric properties of discrete space-filling curves. IEEE Transactions on Image Processing\u00a05(5), 794\u2013797 (1996)","journal-title":"IEEE Transactions on Image Processing"},{"key":"17_CR20","unstructured":"Wierum, J.M.: Logarithmic path-length in space-filling curves. In: 14th Canadian Conference on Computational Geometry, pp. 22\u201326 (2002)"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1145\/48529.48535","volume":"31","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Vitter, J.S.: The input\/output complexity of sorting and related problems. Communications of ACM\u00a031, 1116\u20131127 (1988)","journal-title":"Communications of ACM"},{"issue":"3","key":"17_CR22","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1111\/j.1467-8659.2006.00970.x","volume":"25","author":"S.E. Yoon","year":"2006","unstructured":"Yoon, S.E., Manocha, D.: Cache-efficient layouts of bounding volume hierarchies. Computer Graphics Forum (Eurographics)\u00a025(3), 507\u2013516 (2006)","journal-title":"Computer Graphics Forum (Eurographics)"},{"key":"17_CR23","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1016\/0020-0190(77)90031-X","volume":"6","author":"P. Emde Boas van","year":"1977","unstructured":"van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Inf. Process. Lett.\u00a06, 80\u201382 (1977)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1006\/jagm.1993.1013","volume":"14","author":"K. Diks","year":"1993","unstructured":"Diks, K., Djidjev, H., S\u00fdkora, O., Vrto, I.: Edge separators of planar and outerplanar graphs with applications. J. Algorithms\u00a014(2), 258\u2013279 (1993)","journal-title":"J. Algorithms"},{"issue":"2","key":"17_CR25","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM Journal on Applied Mathematics\u00a036(2), 177\u2013189 (1979)","journal-title":"SIAM Journal on Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T00:09:30Z","timestamp":1558397370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}