{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T11:40:12Z","timestamp":1737632412954,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676904"},{"type":"electronic","value":"9783540449850"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_8","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:17:33Z","timestamp":1194985053000},"page":"71-82","source":"Crossref","is-referenced-by-count":0,"title":["A Dynamic Algorithm for Maintaining Graph Partitions"],"prefix":"10.1007","author":[{"given":"Lyudmil G.","family":"Aleksandrov","sequence":"first","affiliation":[]},{"given":"Hristo_N.","family":"Djidjev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S0895480194272183","volume":"9","author":"L. Aleksandrov","year":"1996","unstructured":"Lyudmil Aleksandrov and Hristo N. Djidjev. Linear algorithms for partitioning embedded graphs of bounded genus. SIAM Journal on Discrete Mathematics, 9:129\u2013150, 1996.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Noga Alon, Paul Seymour, and Robin Thomas. A separator theorem for graphs with an excluded minor and its applications. Proceedings of the 22nd Symp. on Theory of Computing, pages 293\u2013299, 1990.","DOI":"10.1145\/100216.100254"},{"key":"8_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/3-540-57155-8_240","volume-title":"Proc. 3rd Worksh. Algorithms and Data Structures","author":"D. Armon","year":"1993","unstructured":"D. Armon and J. Reif. A dynamic separator algorithm. In Proc. 3rd Worksh. Algorithms and Data Structures, pages 107\u2013118. Lecture Notes in Computer Science 709, Springer-Verlag, Berlin, 1993."},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0022-0000(84)90071-0","volume":"28","author":"S.N. Bhatt","year":"1984","unstructured":"S.N. Bhatt and F.T. Leighton. A framework for solving VLSI graph layout problems. Journal of Computer and System Sciences, 28:300\u2013343, 1984.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and Groups. Springer-Verlag, 1988.","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"8_CR6","first-page":"643","volume":"34","author":"H. N. Djidjev","year":"1981","unstructured":"Hristo N. Djidjev. A separator theorem. Compt. rend. Acad. bulg. Sci., 34:643\u2013645, 1981.","journal-title":"Compt. rend. Acad. bulg. Sci."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"G.N. Frederickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal on Computing, 16:1004\u20131022, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","volume":"5","author":"J. R. Gilbert","year":"1984","unstructured":"John R. Gilbert, Joan P. Hutchinson, and Robert E. Tarjan. A separator theorem for graphs of bounded genus. J. Algorithms, 5:391\u2013407, 1984.","journal-title":"J. Algorithms"},{"key":"8_CR9","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/BF01396660","volume":"50","author":"J. R. Gilbert","year":"1987","unstructured":"John R. Gilbert and Robert E. Tarjan. The analysis of a nested dissection algorithm. Numerische Mathematik, 50:377\u2013404, 1987.","journal-title":"Numerische Mathematik"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Michael T. Goodrich. Planar separators and parallel polygon triangulation. Proceedings of 24th Symp. on Theory of Computing, pages 507\u2013516, 1992.","DOI":"10.1145\/129712.129762"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, pages 671\u2013680, 1983.","DOI":"10.1126\/science.220.4598.671"},{"key":"8_CR12","volume-title":"Foundations of Computing","author":"C.E. Leiserson","year":"1983","unstructured":"C.E. Leiserson. Area efficient VLSI computation. In Foundations of Computing. MIT Press, Cambridge, MA, 1983."},{"key":"8_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"B.W. Kernighan & S. Lin. An Efficient Heuristic Procedure for Partitioning Graphs. Bell Systems Technical Journal, 49:291\u2013308, 1970.","journal-title":"Bell Systems Technical Journal"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1137\/0716027","volume":"16","author":"R. J. Lipton","year":"1979","unstructured":"Richard J. Lipton, D. J. Rose, and Robert E. Tarjan. Generalized nested dissection. SIAM J. Numer. Anal., 16:346\u2013358, 1979.","journal-title":"SIAM J. Numer. Anal."},{"key":"8_CR15","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R. J. Lipton","year":"1979","unstructured":"Richard J. Lipton and Robert E. Tarjan. A separator theorem for planar graphs. SIAM J. Appl. Math, 36:177\u2013189, 1979.","journal-title":"SIAM J. Appl. Math"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1137\/0209046","volume":"9","author":"R. J. Lipton","year":"1980","unstructured":"Richard J. Lipton and Robert E. Tarjan. Applications of a planar separator theorem. SIAM Journal on Computing, 9:615\u2013627, 1980.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Gary L. Miller, Shang-Hua Teng, and Stephen A. Vavasis. A unified geometric approach to graph separators. Proceedings of the 32nd FOCS, pages 538\u2013547, 1991.","DOI":"10.1109\/SFCS.1991.185417"},{"issue":"3","key":"8_CR18","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H. D. Simon, and K.-P. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. Matrix Anal. Appl, 11(3):430\u2013452, July 1990.","journal-title":"SIAM J. Matrix Anal. Appl"},{"key":"8_CR19","unstructured":"Eric J. Schwabe, Guy E. Blelloch, Anja Feldmann, Omar Ghattas, John R. Gilbert, Gary L. Miller, David R. O\u2019Hallaron, Jonathan R. Shewchuk, and Shang-Hua Teng. A Separator-Based Framework for Automated Partitioning and Mapping of Parallel Algorithms for Numerical Solution of PDEs. In Proceedings of the First Annual Summer Institute on Issues and Obstacles in the Practical Implementation of Parallel Algorithms and the Use of Parallel Machines in Parallel Computation (DAGS\/PC\u2019 92, pages 48\u201362. Dartmouth Institute for Advanced Graduate Studies, June 1992."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T08:18:14Z","timestamp":1737533894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}