{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:40:34Z","timestamp":1743129634723,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":16,"publisher":"Springer Singapore","isbn-type":[{"type":"print","value":"9789811600098"},{"type":"electronic","value":"9789811600104"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","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":[[2021]]},"DOI":"10.1007\/978-981-16-0010-4_2","type":"book-chapter","created":{"date-parts":[[2021,2,9]],"date-time":"2021-02-09T00:19:49Z","timestamp":1612829989000},"page":"12-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Decycling Problem in a Torus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9381-9346","authenticated-orcid":false,"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,2,7]]},"reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-319-07518-1_35","volume-title":"Supercomputing","author":"Y Ajima","year":"2014","unstructured":"Ajima, Y., et al.: Tofu interconnect 2: system-on-chip integration of high-performance interconnect. In: Kunkel, J.M., Ludwig, T., Meuer, H.W. (eds.) ISC 2014. LNCS, vol. 8488, pp. 498\u2013507. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07518-1_35"},{"key":"2_CR2","unstructured":"Ajima, Y., et al.: The Tofu interconnect D. In: Proceedings of the IEEE International Conference on Cluster Computing, pp. 646\u2013654, Belfast, UK, 10\u201313 September 2018"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Alverson, R., Roweth, D., Kaplan, L.: The Gemini system interconnect. In: Proceedings of the 18th IEEE Symposium on High Performance Interconnects, pp. 83\u201387, Mountain View, CA, USA, 18\u201320 August 2010","DOI":"10.1109\/HOTI.2010.23"},{"key":"2_CR4","first-page":"129","volume":"59","author":"S Bau","year":"2001","unstructured":"Bau, S., Beineke, L., Liu, Z., Du, G.M., Vandell, R.: Decycling cubes and grids. Utilitas Math. 59, 129\u2013138 (2001)","journal-title":"Utilitas Math."},{"key":"2_CR5","first-page":"285","volume":"25","author":"S Bau","year":"2002","unstructured":"Bau, S., Beineke, L.W.: The decycling number of graphs. Australas. J. Comb. 25, 285\u2013298 (2002)","journal-title":"Australas. J. Comb."},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/(SICI)1097-0118(199705)25:1<59::AID-JGT4>3.0.CO;2-H","volume":"25","author":"LW Beineke","year":"1997","unstructured":"Beineke, L.W., Vandell, R.C.: Decycling graphs. J. Graph Theory 25(1), 59\u201377 (1997)","journal-title":"J. Graph Theory"},{"issue":"2","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1350006.1","DOI":"10.1142\/S0219265913500060","volume":"14","author":"A Bossard","year":"2013","unstructured":"Bossard, A.: On the decycling problem in hierarchical hypercubes. J. Interconnect. Netw. 14(2), 1350006.1\u20131350006.13 (2013)","journal-title":"J. Interconnect. Netw."},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s11227-014-1152-7","volume":"69","author":"A Bossard","year":"2014","unstructured":"Bossard, A.: The decycling problem in hierarchical cubic networks. J. Supercompt. 69(1), 293\u2013305 (2014). https:\/\/doi.org\/10.1007\/s11227-014-1152-7","journal-title":"J. Supercompt."},{"key":"2_CR9","doi-asserted-by":"publisher","unstructured":"Festa, P., Pardalos, P.M., Resende, M.G.C.: Feedback set problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 209\u2013258. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_4","DOI":"10.1007\/978-1-4757-3023-4_4"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11847250_17","volume-title":"Parameterized and Exact Computation","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., Gaspers, S., Pyatkin, A.V.: Finding a minimum feedback vertex set in time $$\\cal{O} (1.7548^n)$$. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 184\u2013191. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11847250_17"},{"key":"2_CR11","series-title":"The IBM Research Symposia Series","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Springer, Boston (1972). https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"2_CR12","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0252-9602(17)30520-9","volume":"19","author":"D Li","year":"1999","unstructured":"Li, D., Liu, Y.: A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph. Acta Math. Sci. 19(4), 375\u2013381 (1999)","journal-title":"Acta Math. Sci."},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","volume":"52","author":"YD Liang","year":"1994","unstructured":"Liang, Y.D.: On the feedback vertex set problem in permutation graphs. Inf. Process. Lett. 52(3), 123\u2013129 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"5","key":"2_CR14","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s002360050088","volume":"34","author":"YD Liang","year":"1997","unstructured":"Liang, Y.D., Chang, M.S.: Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Informatica 34(5), 337\u2013346 (1997)","journal-title":"Acta Informatica"},{"issue":"4","key":"2_CR15","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/s00373-003-0529-9","volume":"19","author":"DA Pike","year":"2003","unstructured":"Pike, D.A.: Decycling hypercubes. Graphs Comb. 19(4), 547\u2013550 (2003)","journal-title":"Graphs Comb."},{"key":"2_CR16","unstructured":"TOP500: TOP500 List - November 2020. https:\/\/www.top500.org\/lists\/top500\/list\/2020\/11\/. Accessed November 2020"}],"container-title":["Communications in Computer and Information Science","Parallel Architectures, Algorithms and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-0010-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T14:40:20Z","timestamp":1617288020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-16-0010-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9789811600098","9789811600104"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-0010-4_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"7 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Parallel Architectures, Algorithms and Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shenzhen","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"paap2020","order":10,"name":"conference_id","label":"Conference ID","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":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"37","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":"0","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":"49% - 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":"6","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)"}}]}}