{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:02Z","timestamp":1725490202018},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_29","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T11:13:34Z","timestamp":1188299614000},"page":"393-401","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchical Vertex Ordering"],"prefix":"10.1007","author":[{"given":"Sung-Ho","family":"Woo","sequence":"first","affiliation":[]},{"given":"Sung-Bong","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Alpert, C., Kahng, A.: A general framework for vertex orderings, with applications to netlist clustering. IEEE Trans. Very Large Scale Integrations Systems. 4(2) (1996)","DOI":"10.1109\/92.502195"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Alpert, C., Kahng, A.: Multiway partitioning via geometric embeddings, orderings, and dynamic programming. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems. 14(11) (1995)","DOI":"10.1109\/43.469661"},{"issue":"11","key":"29_CR3","doi-asserted-by":"publisher","first-page":"1684","DOI":"10.1109\/32.9055","volume":"14","author":"J. Banerjee","year":"1988","unstructured":"Banerjee, J., Kim, W., Kim, S., Garza, J.: Clustering a DAG for CAD databases. IEEE Trans. Software Engineering. 14(11) (1988) 1684\u20131699","journal-title":"IEEE Trans. Software Engineering"},{"key":"29_CR4","unstructured":"Garey, M., Johnson, D.: Computers and intractability: A guide to the theory of NP-completeness. Freeman and Company (1979)"},{"key":"29_CR5","unstructured":"Hendrickson B., Leland R.: The Chaco user\u2019s guide Version 2.0. Tech. Rep. Sandia National Laboratories (1995)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0166-218X(92)90229-4","volume":"36","author":"M. Juvan","year":"1992","unstructured":"Juvan, M., Mohar, B.: Optimal linear labelings and eigenvalues of graphs. Discrete Applied Mathematics. 36 (1992) 153\u2013168","journal-title":"Discrete Applied Mathematics"},{"issue":"3","key":"29_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1109\/M-PDT.1995.414844","volume":"3","author":"M. Kaddoura","year":"1995","unstructured":"Kaddoura, M., Ou, C., Ranka, S.: Partitioning unstructured computational graphs for nonuniform and adaptive environments. IEEE Parallel and Distributd Technology. 3(3) (1995) 63\u201369","journal-title":"IEEE Parallel and Distributd Technology"},{"key":"29_CR8","unstructured":"Karypis, G., Kumar, V.: METIS, a software package for partitioning graphs. Available on WWW at URL: http:\/\/www.cs.umn.edu\/karypis\/metis\/ ."},{"issue":"1","key":"29_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality scheme for partitioning irregular graphs. SIAM Journal on Scientific Computing. 20(1) (1999) 359\u2013392","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"1","key":"29_CR10","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1137\/0405004","volume":"5","author":"H. Nagamochi","year":"1992","unstructured":"Nagamochi, H., Ibaraki, T.: Computing edge-connectivity in multi-graphs and capacitated graphs. SIAM Journal on Discerete Mathematics. 5(1) (1992) 54\u201366","journal-title":"SIAM Journal on Discerete Mathematics"},{"key":"29_CR11","unstructured":"Petit, J.: Approximation heuristics and benchmarkings for the MINLA problem. Algorithms and Experiments. (1998) 112\u2013128"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Riess, B., Doll, K., Johannes, F.: Partitioning very large circuits using analytical placement techniques. Proc. ACM\/IEEE Design Automation Conf. (1994) 645\u2013651","DOI":"10.1145\/196244.196602"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Shekhar, S., Liu, D.: CCAM: A connectivity-clustered access method for networks and network computations. IEEE Trans. Knowledge and Data Engineering. 9(1) (1997)","DOI":"10.1109\/69.567054"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T13:13:18Z","timestamp":1556802798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}