{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:52:35Z","timestamp":1742914355996,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319937120"},{"type":"electronic","value":"9783319937137"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/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-93713-7_35","type":"book-chapter","created":{"date-parts":[[2018,6,12]],"date-time":"2018-06-12T00:19:02Z","timestamp":1528762742000},"page":"416-424","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Modified Bandwidth Reduction Heuristic Based on the WBRA and George-Liu Algorithm"],"prefix":"10.1007","author":[{"given":"Sanderson L.","family":"Gonzaga de Oliveira","sequence":"first","affiliation":[]},{"given":"Guilherme O.","family":"Chagas","sequence":"additional","affiliation":[]},{"given":"Diogo T.","family":"Robaina","sequence":"additional","affiliation":[]},{"given":"Diego N.","family":"Brand\u00e3o","sequence":"additional","affiliation":[]},{"given":"Mauricio","family":"Kischinhevsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"35_CR1","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. Procedia Comput. Sci. 51, 221\u2013230 (2015)","journal-title":"Procedia Comput. Sci."},{"key":"35_CR2","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. Procedia Comput. Sci. 51, 211\u2013220 (2015)","journal-title":"Procedia Comput. Sci."},{"issue":"1","key":"35_CR3","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. Software 38(1), 1\u201325 (2011)","journal-title":"ACM Trans. Math. Software"},{"key":"35_CR4","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/S0167-6377(98)00040-6","volume":"23","author":"A Esposito","year":"1998","unstructured":"Esposito, A., Catalano, M.S.F., Malucelli, F., Tarricone, L.: A new matrix bandwidth reduction algorithm. Oper. Res. Lett. 23, 99\u2013107 (1998)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"35_CR5","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. Software 5(3), 284\u2013295 (1979)","journal-title":"ACM Trans. Math. Software"},{"issue":"2","key":"35_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1137\/0713023","volume":"13","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. 13(2), 236\u2013250 (1976)","journal-title":"SIAM J. Numer. Anal."},{"key":"35_CR7","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s40314-016-0394-9","DOI":"10.1007\/s40314-016-0394-9"},{"key":"35_CR8","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). https:\/\/doi.org\/10.1007\/s40314-017-0490-5","DOI":"10.1007\/s40314-017-0490-5"},{"key":"35_CR9","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: Proceedings of the Brazilian Symposium on Operations Research (SBPO 2015), Sobrapo, Ipojuca, Brazil (2015)"},{"issue":"1","key":"35_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02006264","volume":"10","author":"YX Lin","year":"1994","unstructured":"Lin, Y.X., Yuan, J.J.: Profile minimization problem for matrices and graphs. Acta Mathematicae Applicatae Sinica 10(1), 107\u2013122 (1994)","journal-title":"Acta Mathematicae Applicatae Sinica"},{"key":"35_CR11","first-page":"177","volume":"16","author":"CH Papadimitriou","year":"1976","unstructured":"Papadimitriou, C.H.: The NP-completeness of bandwidth minimization problem. Comput. J. 16, 177\u2013192 (1976)","journal-title":"Comput. J."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93713-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T00:06:58Z","timestamp":1654992418000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93713-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319937120","9783319937137"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93713-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"406","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"148","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}