{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:49:39Z","timestamp":1742964579115,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662535356"},{"type":"electronic","value":"9783662535363"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-53536-3_1","type":"book-chapter","created":{"date-parts":[[2016,9,27]],"date-time":"2016-09-27T12:39:25Z","timestamp":1474979965000},"page":"1-12","source":"Crossref","is-referenced-by-count":1,"title":["Sequences of Radius k for Complete Bipartite\u00a0Graphs"],"prefix":"10.1007","author":[{"given":"Micha\u0142","family":"D\u0119bski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zbigniew","family":"Lonc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pawe\u0142","family":"Rz\u0105\u017cewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,28]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N Alon","year":"2008","unstructured":"Alon, N., Spencer, J.: The Probabilistic Method, 3rd edn. Wiley, Hoboken (2008)","edition":"3"},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(81)90048-X","volume":"13","author":"AA Bertossi","year":"1981","unstructured":"Bertossi, A.A.: The edge Hamiltonian path problem is NP-complete. Inf. Proc. Lett. 13, 157\u2013159 (1981)","journal-title":"Inf. Proc. Lett."},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1016\/j.jcta.2011.08.004","volume":"119","author":"SR Blackburn","year":"2012","unstructured":"Blackburn, S.R.: The existence of \n            $$k$$\n          -radius sequences. J. Combin. Theor. Ser. A 119, 212\u2013217 (2012)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"1_CR4","doi-asserted-by":"crossref","first-page":"2439","DOI":"10.1090\/S0025-5718-2011-02510-X","volume":"81","author":"SR Blackburn","year":"2012","unstructured":"Blackburn, S.R., McKee, J.F.: Constructing \n            $$k$$\n          -radius sequences. Math. Comput. 81, 2439\u20132459 (2012)","journal-title":"Math. Comput."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1090\/S0025-5718-2011-02473-7","volume":"81","author":"YM Chee","year":"2012","unstructured":"Chee, Y.M., Ling, S., Tan, Y., Zhang, X.: Universal cycles for minimum coverings of pairs by triples, with applications to 2-radius sequences. Math. Comput. 81, 585\u2013603 (2012)","journal-title":"Math. Comput."},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1002\/jgt.3190060302","volume":"6","author":"P Chinn","year":"1982","unstructured":"Chinn, P., Chv\u00e1talov\u00e1, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices - a survey. J. Graph Theor. 6, 223\u2013254 (1982)","journal-title":"J. Graph Theor."},{"key":"1_CR7","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.ejc.2014.04.005","volume":"41","author":"M D\u0119bski","year":"2014","unstructured":"D\u0119bski, M., Lonc, Z.: Sequences of large radius. Eur. J. Comb. 41, 197\u2013204 (2014)","journal-title":"Eur. J. Comb."},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0195-6698(85)80045-7","volume":"6","author":"P Frankl","year":"1985","unstructured":"Frankl, P., R\u00f6dl, V.: Near perfect coverings in graphs and hypergraphs. Eur. J. Comb. 6, 317\u2013326 (1985)","journal-title":"Eur. J. Comb."},{"key":"1_CR9","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1137\/0134037","volume":"34","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Graham, R.L., Johnson, D.S., Knuth, D.E.: Complexity results for bandwidth minimization. SIAM J. Appl. Math. 34, 477\u2013495 (1978)","journal-title":"SIAM J. Appl. Math."},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/978-3-540-30551-4_52","volume-title":"Algorithms and Computation","author":"JW Jaromczyk","year":"2004","unstructured":"Jaromczyk, J.W., Lonc, Z.: Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 594\u2013605. Springer, Heidelberg (2004)"},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"731","DOI":"10.1016\/j.jcta.2011.11.009","volume":"119","author":"J Jaromczyk","year":"2012","unstructured":"Jaromczyk, J., Lonc, Z., Truszczy\u0144ski, M.: Constructions of asymptotically shortest \n            $$k$$\n          -radius sequences. J. Combin. Theor. Ser. A 119, 731\u2013746 (2012)","journal-title":"J. Combin. Theor. Ser. A"},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-0-387-30162-4_219","volume":"1","author":"A Newman","year":"2008","unstructured":"Newman, A.: Max-cut. Encycl. Algorithms 1, 489\u2013492 (2008)","journal-title":"Encycl. Algorithms"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1090\/dimacs\/020\/04","volume":"20","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Tuza, Z.: Maximum cuts and large bipartite subgraphs. DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 20, 181\u2013244 (1995)","journal-title":"DIMACS Ser. Discrete Math. Theoret. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53536-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,7]],"date-time":"2017-06-07T05:02:23Z","timestamp":1496811743000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53536-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662535356","9783662535363"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53536-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}