{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:12:06Z","timestamp":1743055926819,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319095837"},{"type":"electronic","value":"9783319095844"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09584-4_8","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T12:00:41Z","timestamp":1406808041000},"page":"77-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Continuous Refinement Strategy for the Multilevel Computation of Vertex Separators"],"prefix":"10.1007","author":[{"given":"William W.","family":"Hager","sequence":"first","affiliation":[]},{"given":"James T.","family":"Hungerford","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Safro","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,1]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Hager, W.W., Hungerford, J.T.: Continuous quadratic programming formulations of optimization problems on graphs. European J. Oper. Res. (2013). http:\/\/dx.doi.org\/10.1016\/j.ejor.2014.05.042","DOI":"10.1016\/j.ejor.2014.05.042"},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0574-7","volume":"103","author":"E Balas","year":"2005","unstructured":"Balas, E., de Souza, C.C.: The vertex separator problem: a polyhedral investigation. Math. Program. 103, 583\u2013608 (2005)","journal-title":"Math. Program."},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen, A., Simon, H.D., Liou, K.: Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl. 11(3), 430\u2013452 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"8_CR4","volume-title":"Computational Aspects of VLSI","author":"J Ullman","year":"1984","unstructured":"Ullman, J.: Computational Aspects of VLSI. Computer Science Press, Rockville (1984)"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"T Bui","year":"1992","unstructured":"Bui, T., Jones, C.: Finding good approximate vertex and edge partitions is NP-hard. Inf. Process. Lett. 42, 153\u2013159 (1992)","journal-title":"Inf. Process. Lett."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference Las Vegas, NV, pp. 175\u2013181 (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.: Improved approximation algorithms for vertex separators. SIAM J. Comput. 38, 629\u2013657 (2008)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"8_CR9","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1137\/100791142","volume":"9","author":"D Ron","year":"2011","unstructured":"Ron, D., Safro, I., Brandt, A.: Relaxation-based coarsening and multiscale graph organization. Multiscale Model. Simul. 9(1), 407\u2013423 (2011)","journal-title":"Multiscale Model. Simul."},{"key":"8_CR10","unstructured":"Buluc, A., Meyerhenke, H., Safro, I., Sanders, P., Schulz, C.: Recent advances in graph partitioning (2013) arXiv:1311.3144"},{"key":"8_CR11","unstructured":"Leiserson, C., Lewis, J.: Orderings for parallel sparse symmetric factorization. In: Third SIAM Conference on Parallel Processing for Scientific Computing, pp. 27\u201331 (1987)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"237","DOI":"10.7155\/jgaa.00126","volume":"10","author":"I Safro","year":"2006","unstructured":"Safro, I., Ron, D., Brandt, A.: A multilevel algorithm for the minimum 2-sum problem. J. Graph Algorithms Appl. 10, 237\u2013258 (2006)","journal-title":"J. Graph Algorithms Appl."},{"issue":"5","key":"8_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.entcs.2011.06.003","volume":"264","author":"B Dezs\u0151","year":"2011","unstructured":"Dezs\u0151, B., J\u00fcttner, A., Kov\u00e1cs, P.: Lemon - an open source C++ graph template library. Electron. Notes Theoret. Comput. Sci. 264(5), 23\u201345 (2011)","journal-title":"Electron. Notes Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09584-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T05:40:58Z","timestamp":1676871658000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09584-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319095837","9783319095844"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09584-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"1 August 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}