{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:44Z","timestamp":1725579044094},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_19","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T04:03:12Z","timestamp":1300075392000},"page":"181-191","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Connectivity Testing of Hypercubic Networks with Faults"],"prefix":"10.1007","author":[{"given":"Tom\u00e1\u0161","family":"Dvo\u0159\u00e1k","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"Fink","sequence":"additional","affiliation":[]},{"given":"Petr","family":"Gregor","sequence":"additional","affiliation":[]},{"given":"V\u00e1clav","family":"Koubek","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/0404045","volume":"4","author":"M.Y. Chan","year":"1991","unstructured":"Chan, M.Y., Lee, S.-J.: On the existence of Hamiltonian circuits in faulty hypercubes. SIAM J.\u00a0Discrete\u00a0Math.\u00a04, 511\u2013527 (1991)","journal-title":"SIAM J.\u00a0Discrete\u00a0Math."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11227-009-0316-3","volume":"54","author":"Y.-C. Chen","year":"2010","unstructured":"Chen, Y.-C., Huang, Y.-Z., Hsu, L.-H., Tan, J.J.M.: A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance. J. Supercomput.\u00a054, 229\u2013238 (2010)","journal-title":"J. Supercomput."},{"key":"19_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1137\/060678476","volume":"22","author":"T. Dvo\u0159\u00e1k","year":"2008","unstructured":"Dvo\u0159\u00e1k, T., Gregor, P.: Partitions of faulty hypercubes into paths with prescribed endvertices. SIAM J. Discrete Math.\u00a022, 1448\u20131461 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"3763","DOI":"10.1016\/j.ins.2009.06.029","volume":"179","author":"T. Dvo\u0159\u00e1k","year":"2009","unstructured":"Dvo\u0159\u00e1k, T., Koubek, V.: Long paths in hypercubes with a quadratic number of faults. Inf. Sci.\u00a0179, 3763\u20133771 (2009)","journal-title":"Inf. Sci."},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"3774","DOI":"10.1016\/j.tcs.2010.07.001","volume":"411","author":"T. Dvo\u0159\u00e1k","year":"2010","unstructured":"Dvo\u0159\u00e1k, T., Koubek, V.: Computational complexity of long paths and cycles in faulty hypercubes. Theor. Comput. Sci.\u00a0411, 3774\u20133786 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"3634","DOI":"10.1016\/j.ins.2009.06.011","volume":"179","author":"J. Fink","year":"2009","unstructured":"Fink, J., Gregor, P.: Long paths and cycles in hypercubes with faulty vertices. Inf. Sci.\u00a0179, 3634\u20133644 (2009)","journal-title":"Inf. Sci."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L.H. Harper","year":"1966","unstructured":"Harper, L.H.: Optimal Numberings and Isoperimetric Problems on Graphs. J. Comb. Theory\u00a01, 385\u2013393 (1966)","journal-title":"J. Comb. Theory"},{"key":"19_CR9","volume-title":"The Art of Computer Programming : Sorting and Searching","author":"D.E. Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming: Sorting and Searching, 2nd edn., vol.\u00a0III. Addison-Wesley, Reading (1998)","edition":"2"},{"key":"19_CR10","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"F.T. Leighton","year":"1992","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Mateo (1992)"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1109\/TC.2008.160","volume":"58","author":"J.-H. Park","year":"2009","unstructured":"Park, J.-H., Kim, H.-C., Lim, H.-S.: Many-to-Many Disjoint Path Covers in the Presence of Faulty Elements. IEEE Trans. Comput.\u00a058, 528\u2013540 (2009)","journal-title":"IEEE Trans. Comput."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T06:31:30Z","timestamp":1558420290000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}