{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:36Z","timestamp":1759638396299},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,25]],"date-time":"2014-03-25T00:00:00Z","timestamp":1395705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s11227-014-1152-7","type":"journal-article","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T07:27:11Z","timestamp":1395646031000},"page":"293-305","source":"Crossref","is-referenced-by-count":13,"title":["The decycling problem in hierarchical cubic networks"],"prefix":"10.1007","volume":"69","author":[{"given":"Antoine","family":"Bossard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,25]]},"reference":[{"key":"1152_CR1","first-page":"285","volume":"25","author":"S Bau","year":"2002","unstructured":"Bau S, Beineke LW (2002) The decycling number of graphs. Aust J Comb 25:285\u2013298","journal-title":"Aust J Comb"},{"key":"1152_CR2","first-page":"129","volume":"59","author":"S Bau","year":"2001","unstructured":"Bau S, Beineke LW, Liu Z, Du G, Vandell RC (2001) Decycling cubes and grids. Utilitas Mathe 59:129\u2013137","journal-title":"Utilitas Mathe"},{"issue":"1","key":"1152_CR3","doi-asserted-by":"crossref","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 LW, Vandell RC (1997) Decycling graphs. J Graph Theory 25(1):59\u201377","journal-title":"J Graph Theory"},{"issue":"12","key":"1152_CR4","doi-asserted-by":"crossref","first-page":"1440","DOI":"10.1093\/comjnl\/bxr137","volume":"55","author":"A Bossard","year":"2012","unstructured":"Bossard A, Kaneko K (2012) Node-to-set disjoint-path routing in hierarchical cubic networks. Comput J 55(12):1440\u20131446","journal-title":"Comput J"},{"key":"1152_CR5","doi-asserted-by":"crossref","unstructured":"Festa P, Pardalos PM, Resende MGC (1999) Feedback set problems. Handbook of Combinatorial, Optimization A, pp 209\u2013258","DOI":"10.1007\/978-1-4757-3023-4_4"},{"issue":"3","key":"1152_CR6","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1002\/net.10040","volume":"40","author":"JS Fu","year":"2002","unstructured":"Fu JS, Chen GH, Duh DR (2002) Node-disjoint paths and related problems on hierarchical cubic networks. Networks 40(3):142\u2013154","journal-title":"Networks"},{"issue":"6","key":"1152_CR7","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0020-0190(93)90043-9","volume":"45","author":"L Gargano","year":"1993","unstructured":"Gargano L, Vaccaro U, Vozella A (1993) Fault-tolerant routing in the star and pancake interconnection networks. Inf Process Lett 45(6):315\u2013320","journal-title":"Inf Process Lett"},{"issue":"4","key":"1152_CR8","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1109\/71.372797","volume":"6","author":"K Ghose","year":"1995","unstructured":"Ghose K, Desai KR (1995) Hierarchical cubic network. IEEE Trans Parallel Distrib Syst 6(4):427\u2013435","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1152_CR9","doi-asserted-by":"crossref","unstructured":"Karp R (1972) Reducibility among combinatorial problems. In: Thatcher J (ed) Miller R. Plenum Press, Complexity of computer computations, pp 85\u2013103","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"1152_CR10","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/S0252-9602(17)30520-9","volume":"19","author":"DM Li","year":"1999","unstructured":"Li DM, Liu YP (1999) A polynomial algorithm for finding the minimum feedback vertex set of a 3-regular simple graph. Acta Mathe Scientia (English Ed) 19(4):375\u2013381","journal-title":"Acta Mathe Scientia (English Ed)"},{"issue":"1","key":"1152_CR11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/B:SUPE.0000014803.83151.dc","volume":"28","author":"Y Li","year":"2004","unstructured":"Li Y, Peng S, Chu W (2004) Efficient collective communications in dual-cube. J Supercomput 28(1):71\u201390","journal-title":"J Supercomput"},{"issue":"2","key":"1152_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/s11227-009-0297-2","volume":"53","author":"Y Li","year":"2010","unstructured":"Li Y, Peng S, Chu W (2010) Metacube\u2014a versatile family of interconnection networks for extremely large-scale supercomputers. J Supercomput 53(2):329\u2013351","journal-title":"J Supercomput"},{"issue":"3","key":"1152_CR13","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(94)00133-2","volume":"52","author":"YD Liang","year":"1994","unstructured":"Liang YD (1994) On the feedback vertex set problem in permutation graphs. Inf Process Lett 52(3):123\u2013129","journal-title":"Inf Process Lett"},{"issue":"5","key":"1152_CR14","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s002360050088","volume":"34","author":"YD Liang","year":"1997","unstructured":"Liang YD, Chang MS (1997) Minimum feedback vertex sets in cocomparability graphs and convex bipartite graphs. Acta Inform 34(5):337\u2013346","journal-title":"Acta Inform"},{"issue":"4","key":"1152_CR15","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s00373-003-0529-9","volume":"19","author":"DA Pike","year":"2003","unstructured":"Pike DA (2003) Decycling hypercubes. Graphs Combin 19(4):547\u2013550","journal-title":"Graphs Combin"},{"key":"1152_CR16","unstructured":"TOP500 (2011) Japan\u2019s K computer tops 10 petaflop\/s to stay atop TOP500 list. http:\/\/top500.org\/lists\/2011\/11\/ . Last Accessed June 2013"},{"key":"1152_CR17","doi-asserted-by":"crossref","unstructured":"Vardy A (1997) Algorithmic complexity in coding theory and the minimum distance problem. In: Proceedings of the symposium on the theory of computing, pp 92\u2013109","DOI":"10.1145\/258533.258559"},{"issue":"4","key":"1152_CR18","doi-asserted-by":"crossref","first-page":"410","DOI":"10.1109\/71.667900","volume":"9","author":"SK Yun","year":"1998","unstructured":"Yun SK, Park KH (1998) Comments on \u201chierarchical cubic networks\u201d. IEEE Trans Parallel Distrib Syst 9(4):410\u2013414","journal-title":"IEEE Trans Parallel Distrib Syst"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1152-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1152-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T20:53:04Z","timestamp":1565297584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1152-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,25]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["1152"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1152-7","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,25]]}}}