{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:08:02Z","timestamp":1725574082372},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540212584"},{"type":"electronic","value":"9783540246985"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24698-5_61","type":"book-chapter","created":{"date-parts":[[2011,1,7]],"date-time":"2011-01-07T22:28:22Z","timestamp":1294439302000},"page":"589-598","source":"Crossref","is-referenced-by-count":2,"title":["Bisecting and Gossiping in Circulant Graphs"],"prefix":"10.1007","author":[{"given":"Bernard","family":"Mans","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Shparlinski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"61_CR1","first-page":"393","volume":"3","author":"A. \u00c1d\u00e1m","year":"1967","unstructured":"\u00c1d\u00e1m, A.: Research problem 2-10. J. Combinatorial Theory\u00a03, 393 (1967)","journal-title":"J. Combinatorial Theory"},{"key":"61_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd ACM STOC, Crete, Greece, July 6-8, pp. 601\u2013610 (2001)","DOI":"10.1145\/380752.380857"},{"key":"61_CR3","unstructured":"Ahmadi, A., Belk, R., Tamon, C., Wendler, C.: Mixing in Continuous Quantum Walks on Graphs (April 2003), \n                    \n                      xxx.arxiv.cornell.edu\/pdf\/quant-ph\/0209106"},{"key":"61_CR4","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01371728","volume":"26","author":"F. Annexstein","year":"1993","unstructured":"Annexstein, F., Baumslag, M.: On the diameter and bisector size of Cayley graphs. Mathematical Systems Theory\u00a026, 271\u2013291 (1993)","journal-title":"Mathematical Systems Theory"},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF02579403","volume":"6","author":"L. Babai","year":"1986","unstructured":"Babai, L.: On Lov\u00e1sz\u2019 lattice reduction and the nearest lattice point problem. Combinatorica\u00a06, 11\u201313 (1986)","journal-title":"Combinatorica"},{"key":"61_CR6","first-page":"1749","volume-title":"Handbook of Combinatorics","author":"L. Babai","year":"1995","unstructured":"Babai, L.: Automorphism groups, isomorphism, reconstruction. In: Handbook of Combinatorics, pp. 1749\u20131783. Elsevier, Amsterdam (1995)"},{"issue":"1","key":"61_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0304-3975(00)00213-9","volume":"264","author":"L. Barri\u00e8re","year":"2001","unstructured":"Barri\u00e8re, L., Cohen, J., Mitjana, M.: Gossiping in chordal rings under the line model. Theoretical Computer Science\u00a0264(1), 53\u201364 (2001)","journal-title":"Theoretical Computer Science"},{"key":"61_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/3-540-44612-5_12","volume-title":"Mathematical Foundations of Computer Science 2000","author":"L. Barri\u00e8re","year":"2000","unstructured":"Barri\u00e8re, L., F\u00e0brega, J.: Edge-bisection of chordal rings. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 162\u2013171. Springer, Heidelberg (2000)"},{"key":"61_CR9","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1007\/BF01301966","volume":"29","author":"S.R. Blackburn","year":"1996","unstructured":"Blackburn, S.R.: Node Bisectors of Cayley Graphs. Mathematical Systems Theory\u00a029, 589\u2013598 (1996)","journal-title":"Mathematical Systems Theory"},{"key":"61_CR10","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1995","unstructured":"Bermond, J.-C., Comellas, F., Hsu, D.F.: Distributed loop computer networks: A survey. Journal of Parallel and Distributed Computing\u00a024, 2\u201310 (1995)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"61_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/3-540-48686-0_36","volume-title":"Computing and Combinatorics","author":"J.-Y. Cai","year":"1999","unstructured":"Cai, J.-Y., Havas, G., Mans, B., Nerurkar, A., Seifert, J.-P., Shparlinski, I.: On routing in circulant graphs. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 360\u2013378. Springer, Heidelberg (1999)"},{"key":"61_CR12","first-page":"229","volume":"9","author":"B. Elspas","year":"1970","unstructured":"Elspas, B., Turner, J.: Graphs with circulant adjacency matrices. J. Comb. Theory\u00a09, 229\u2013240 (1970)","journal-title":"J. Comb. Theory"},{"key":"61_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.3230100106","volume":"10","author":"A. Farley","year":"1980","unstructured":"Farley, A.: Minimum-time line broadcast networks. Networks\u00a010, 57\u201370 (1980)","journal-title":"Networks"},{"issue":"2","key":"61_CR14","first-page":"20","volume":"11","author":"R. Gruber","year":"1997","unstructured":"Gruber, R., Gunzinger, A.: The Swiss-Tx Supercomputer Project. Speedup\u00a011(2), 20\u201326 (1997)","journal-title":"Speedup"},{"issue":"4","key":"61_CR15","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/BF01192695","volume":"29","author":"Y.O. Hamidoune","year":"1996","unstructured":"Hamidoune, Y.O., Serra, O.: On small cuts separating an Abelian Cayley graph into two equal parts. Mathe. Systems Theory\u00a029(4), 407\u2013409 (1996)","journal-title":"Mathe. Systems Theory"},{"issue":"4","key":"61_CR16","first-page":"295","volume":"15","author":"J. Hromkovi\u010d","year":"1996","unstructured":"Hromkovi\u010d, J., Klasing, R., St\u00f6hr, E.A.: Dissemination of information in generalized communication modes. Comp. Art. Intell.\u00a015(4), 295\u2013318 (1996)","journal-title":"Comp. Art. Intell."},{"key":"61_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1006\/inco.1995.1154","volume":"123","author":"J. Hromkovi\u010d","year":"1995","unstructured":"Hromkovi\u010d, J., Klasing, R., St\u00f6hr, E.A., Wagener, H.: Gossiping in vertexdisjoint paths mode in d-dimensional grids and planar graphs. Information and Computation\u00a0123, 17\u201328 (1995)","journal-title":"Information and Computation"},{"key":"61_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2618","volume":"133","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J., Klasing, R., Unger, W., Wagener, H.: Optimal algorithms for broadcast and gossip in the edge-disjoint path modes. Information and Computation\u00a0133, 1\u201333 (1997)","journal-title":"Information and Computation"},{"key":"61_CR19","first-page":"229","volume":"83","author":"R. Klasing","year":"1998","unstructured":"Klasing, R.: The relationship between the gossip complexity in the vertex-disjoint paths mode and the vertex bisection width. D.A.M.\u00a083, 229\u2013246 (1998)","journal-title":"D.A.M."},{"key":"61_CR20","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. M. Kaufmann, San Francisco (1992)"},{"key":"61_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"K. Lenstra","year":"1982","unstructured":"Lenstra, K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"issue":"1-3","key":"61_CR22","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0012-365X(01)00374-0","volume":"254","author":"B. Mans","year":"2002","unstructured":"Mans, B., Pappalardi, F., Shparlinski, I.: On the spectral \u00c1d\u00e1m property for circulant graphs. Discrete Math.\u00a0254(1-3), 309\u2013329 (2002)","journal-title":"Discrete Math."},{"key":"61_CR23","volume-title":"Packing and covering","author":"C.A. Rogers","year":"1964","unstructured":"Rogers, C.A.: Packing and covering. Cambridge Univ. Press, NY (1964)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2004: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24698-5_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T13:44:31Z","timestamp":1553348671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24698-5_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212584","9783540246985"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24698-5_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}