{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:57Z","timestamp":1740099117600,"version":"3.37.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319951614"},{"type":"electronic","value":"9783319951621"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-95162-1_9","type":"book-chapter","created":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T04:15:34Z","timestamp":1530591334000},"page":"123-137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Finding a Starting Vertex for the Reverse Cuthill-McKee Method for Bandwidth Reduction: A Comparative Analysis Using Asymmetric Matrices"],"prefix":"10.1007","author":[{"given":"Sanderson L.","family":"Gonzaga de Oliveira","sequence":"first","affiliation":[]},{"given":"Alexandre A. A. M.","family":"de Abreu","sequence":"additional","affiliation":[]},{"given":"Diogo T.","family":"Robaina","sequence":"additional","affiliation":[]},{"given":"Mauricio","family":"Kischinhevsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,4]]},"reference":[{"issue":"1","key":"9_CR1","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The University of Florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Softw."},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Gonzaga de Oliveira, S.L., Bernardes, J.A.B., Chagas, G.O.: An evaluation of reordering algorithms to reduce the computational cost of the incomplete Cholesky-conjugate gradient method. Comput. Appl. Math. (2017). \nhttps:\/\/doi.org\/10.1007\/s40314-017-0490-5","DOI":"10.1007\/s40314-017-0490-5"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.procs.2015.05.229","volume":"51","author":"GO Chagas","year":"2015","unstructured":"Chagas, G.O., Gonzaga de Oliveira, S.L.: Metaheuristic-based heuristics for symmetric-matrix bandwidth reduction: a systematic review. Proc. Comput. Sci. 51, 211\u2013220 (2015). Proceedings of the ICCS - International Conference on Computational Science, Reykjav\u00edk, Iceland","journal-title":"Proc. Comput. Sci."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.procs.2015.05.231","volume":"51","author":"JAB Bernardes","year":"2015","unstructured":"Bernardes, J.A.B., Gonzaga de Oliveira, S.L.: A systematic review of heuristics for profile reduction of symmetric matrices. Proc. Comput. Sci. 51, 221\u2013230 (2015). Proceedings of the ICCS - International Conference on Computational Science, Reykjav\u00edk, Iceland","journal-title":"Proc. Comput. Sci."},{"key":"9_CR5","unstructured":"Gonzaga de Oliveira, S.L., Chagas, G.O.: A systematic review of heuristics for symmetric-matrix bandwidth reduction: methods not based on metaheuristics. In: The XLVII Brazilian Symposium of Operational Research, SBPO, Ipojuca-PE, Brazil, Sobrapo, August 2015"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1007\/s40314-016-0394-9","volume":"37","author":"SL Gonzaga de Oliveira","year":"2018","unstructured":"Gonzaga de Oliveira, S.L., Bernardes, J.A.B., Chagas, G.O.: An evaluation of low-cost heuristics for matrix bandwidth and profile reductions. Comput. Appl. Math. 37(2), 1412\u20131471 (2018). \nhttps:\/\/doi.org\/10.1007\/s40314-016-0394-9","journal-title":"Comput. Appl. Math."},{"key":"9_CR7","unstructured":"George, A.: Computer implementation of the finite element method. Ph.D. thesis. Stanford University, Stanford, USA (1971)"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1145\/355841.355845","volume":"5","author":"A George","year":"1979","unstructured":"George, A., Liu, J.W.H.: An implementation of a pseudoperipheral node finder. ACM Trans. Math. Softw. 5(3), 284\u2013295 (1979)","journal-title":"ACM Trans. Math. Softw."},{"key":"9_CR9","volume-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"A George","year":"1981","unstructured":"George, A., Liu, J.W.: Computer Solution of Large Sparse Positive Definite Systems. Prentice-Hall, Englewood Cliffs (1981)"},{"issue":"5","key":"9_CR10","doi-asserted-by":"publisher","first-page":"1652","DOI":"10.1137\/S1064827597326845","volume":"20","author":"M Benzi","year":"1999","unstructured":"Benzi, M., Szyld, D.B., Van Duin, A.: Orderings for incomplete factorization preconditioning of nonsymmetric problems. SIAM J. Sci. Comput. 20(5), 1652\u20131670 (1999)","journal-title":"SIAM J. Sci. Comput."},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1002\/fld.2614","volume":"69","author":"JJ Camata","year":"2012","unstructured":"Camata, J.J., Rossa, A.L., Valli, A.M.P., Catabriga, L., Carey, G.F., Coutinho, A.L.G.A.: Reordering and incomplete preconditioning in serial and parallel adaptive mesh refinement and coarsening flow solutions. Int. J. Numer. Meth. Fluids 69, 802\u2013823 (2012). \nhttps:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1002\/fld.2614","journal-title":"Int. J. Numer. Meth. Fluids"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Gonzaga de Oliveira, S.L., Abreu, A.A.A.M.: The use of the reverse Cuthill-Mckee method with an alternative pseudo-peripheral vertice finder for profile optimization. In: XXXVII National Conference on Computational and Applied Mathematics, CNMAC, S\u00e3o Jos\u00e9 dos Campos, vol. 6. Sociedade Brasileira de Matem\u00e1tica Aplicada e Computacional (SBMAC), S\u00e3o Carlos (2018)","DOI":"10.5540\/03.2018.006.01.0441"},{"key":"9_CR13","unstructured":"Arany, I.: An efficient algorithm for finding peripheral nodes. In: Lov\u00e1sz, L., Szemer\u00e9di, E. (eds.) Colloquia Mathematica Societatis J\u00e1nos Bolyai (Hungarian Edition), Theory of Algorithms P\u00e9cs, vol. 44, pp. 27\u201335. North-Holland, Budapest (1984)"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/BF02280884","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of bandwidth minimization problem. Computing 16, 177\u2013192 (1976)","journal-title":"Computing"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: ACM Proceedings of the 1969 24th International Conference, pp. 157\u2013172. ACM, New York (1969)","DOI":"10.1145\/800195.805928"},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/BF02252900","volume":"11","author":"K Cheng","year":"1973","unstructured":"Cheng, K.: Minimizing the bandwidth of sparse symmetric matrices. Computing 11, 103\u2013110 (1973)","journal-title":"Computing"},{"issue":"13","key":"9_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"2","author":"NE Gibbs","year":"1976","unstructured":"Gibbs, N.E., Poole, W.G., Stockmeyer, P.K.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM J. Numer. Anal. 2(13), 236\u2013250 (1976)","journal-title":"SIAM J. Numer. Anal."},{"issue":"13","key":"9_CR18","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0377-0427(85)90048-2","volume":"12","author":"WF Smyth","year":"1985","unstructured":"Smyth, W.F.: Algorithms for the reduction of matrix bandwidth and profile. J. Comput. Appl. Math. 12(13), 551\u2013561 (1985)","journal-title":"J. Comput. Appl. Math."},{"key":"9_CR19","unstructured":"Arany, I.: Another method for finding pseudo-peripheral nodes. In: Annales, ed. Eotvos Lorand University, Sectio Computatorica, Tomus IV, Universitatis Scientiarum Budapestinensis De Rolando Eotvos Nominatae, vol. 4, pp. 39\u201349 (1983)"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/0022-0000(84)90012-6","volume":"29","author":"JK Pachl","year":"1984","unstructured":"Pachl, J.K.: Finding pseudoperipheral nodes in graphs. J. Comput. Syst. Sci. 29(1), 48\u201353 (1984)","journal-title":"J. Comput. Syst. Sci."},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"1693","DOI":"10.1002\/nme.1620230208","volume":"23","author":"SW Sloan","year":"1986","unstructured":"Sloan, S.W.: An algorithm for profile and wavefront reduction of sparse matrices. Int. J. Numer. Methods Eng. 23, 1693\u20131704 (1986)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9_CR22","doi-asserted-by":"publisher","first-page":"2555","DOI":"10.1002\/nme.1620281106","volume":"28","author":"IS Duff","year":"1989","unstructured":"Duff, I.S., Reid, J.K., Scott, J.A.: The use of profile reduction algorithms with a frontal code. Int. J. Numer. Methods Eng. 28, 2555\u20132568 (1989)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9_CR23","doi-asserted-by":"publisher","first-page":"2651","DOI":"10.1002\/nme.1620281111","volume":"28","author":"SW Sloan","year":"1989","unstructured":"Sloan, S.W.: A FORTRAN program for profile and wavefront reduction. Int. J. Numer. Methods Eng. 28, 2651\u20132679 (1989)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9_CR24","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/S0045-7949(00)00090-0","volume":"78","author":"A Kaveh","year":"2000","unstructured":"Kaveh, A., Bondarabady, H.A.R.: Ordering for wavefront optimization. Comput. Struct. 78, 227\u2013235 (2000)","journal-title":"Comput. Struct."},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/0045-7949(86)90318-4","volume":"24","author":"A Kaveh","year":"1986","unstructured":"Kaveh, A.: Ordering for bandwidth reduction. Comput. Struct. 24, 413\u2013420 (1986)","journal-title":"Comput. Struct."},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1002\/cnm.1630020213","volume":"2","author":"A Kaveh","year":"1986","unstructured":"Kaveh, A.: Multiple use of a shortest route tree for ordering. Commun. Appl. Numer. Methods 2, 213\u2013215 (1986)","journal-title":"Commun. Appl. Numer. Methods"},{"issue":"6","key":"9_CR27","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1016\/0045-7949(91)90257-M","volume":"41","author":"A Kaveh","year":"1991","unstructured":"Kaveh, A.: A connectivity coordinate system for node and element ordering. Comput. Struct. 41(6), 1217\u20131223 (1991)","journal-title":"Comput. Struct."},{"issue":"1","key":"9_CR28","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0045-7949(90)90196-9","volume":"37","author":"A Kaveh","year":"1990","unstructured":"Kaveh, A.: Algebraic graph theory. Comput. Struct. 37(1), 51\u201354 (1990)","journal-title":"Comput. Struct."},{"key":"9_CR29","volume-title":"Structural Mechanics: Graph and Matrix Methods","author":"A Kaveh","year":"2004","unstructured":"Kaveh, A.: Structural Mechanics: Graph and Matrix Methods. Research Studies Press Ltd., Baldock (2004)"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0045-7949(02)00018-4","volume":"80","author":"A Kaveh","year":"2002","unstructured":"Kaveh, A., Bondarabady, H.A.R.: A hybrid method for finite element ordering. Comput. Struct. 80, 219\u2013225 (2002)","journal-title":"Comput. Struct."},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0611022","volume":"11","author":"RG Grimes","year":"1990","unstructured":"Grimes, R.G., Pierce, D.J., Simon, H.D.: A new algorithm for finding a pseudoperipheral node in a graph. SIAM J. Matrix Anal. Appl. 11, 323\u2013334 (1990)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"19","key":"9_CR32","doi-asserted-by":"publisher","first-page":"3351","DOI":"10.1002\/nme.1620361910","volume":"36","author":"LT Souza","year":"1993","unstructured":"Souza, L.T., Murray, D.W.: An alternative pseudoperipheral node finder for resequencing schemes. Int. J. Numer. Methods Eng. 36(19), 3351\u20133379 (1993)","journal-title":"Int. J. Numer. Methods Eng."},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/0045-7949(92)90386-E","volume":"44","author":"JC Luo","year":"1992","unstructured":"Luo, J.C.: Algorithms for reducing the bandwidth and profile of a sparse matrix. Comput. Struct. 44, 535\u2013548 (1992)","journal-title":"Comput. Struct."},{"key":"9_CR34","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1002\/cnm.1640101107","volume":"10","author":"GH Paulino","year":"1994","unstructured":"Paulino, G.H., Menezes, I.F.M., Gattass, M., Mukherjee, S.: A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph. Commun. Appl. Numer. Methods 10, 913\u2013926 (1994)","journal-title":"Commun. Appl. Numer. Methods"},{"issue":"12","key":"9_CR35","doi-asserted-by":"publisher","first-page":"1737","DOI":"10.1002\/(SICI)1097-0207(19990830)45:12<1737::AID-NME652>3.0.CO;2-T","volume":"45","author":"JK Reid","year":"1999","unstructured":"Reid, J.K., Scott, J.A.: Ordering symmetric sparse matrices for small profile and wavefront. Int. J. Numer. Methods Eng. 45(12), 1737\u20131755 (1999)","journal-title":"Int. J. Numer. Methods Eng."},{"issue":"1","key":"9_CR36","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1016\/j.finel.2011.08.024","volume":"48","author":"Q Wang","year":"2012","unstructured":"Wang, Q., Shi, X., Guo, C., Guo, Y.: An improved GPS method with a new pseudo-peripheral nodes finder in finite element analysis. Finite Elem. Anal. Des. 48(1), 1409\u20131415 (2012)","journal-title":"Finite Elem. Anal. Des."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-95162-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,3]],"date-time":"2018-07-03T04:20:46Z","timestamp":1530591646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-95162-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319951614","9783319951621"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-95162-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}