{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:36:57Z","timestamp":1725482217864},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667315"},{"type":"electronic","value":"9783540467847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_22","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"215-227","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing Bipartite Incident-Graphs of Circulant Digraphs"],"prefix":"10.1007","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Fraigniaud","sequence":"additional","affiliation":[]},{"given":"Cyril","family":"Gavoille","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0021-9800(67)80037-1","volume":"2","author":"A. \u00c1d\u00e1m","year":"1967","unstructured":"A. \u00c1d\u00e1m. Research problem 2-10. J. Combin. Theory, 2:393, 1967. 217","journal-title":"J. Combin. Theory"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(79)90011-6","volume":"25","author":"B. Alspach","year":"1979","unstructured":"B. Alspach and T. Parsons. Isomorphism of circulant graphs and digraphs. Discrete Mathematics, 25:97\u2013108, 1979. 217","journal-title":"Discrete Mathematics"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jpdc.1995.1002","volume":"24","author":"J.-C. Bermond","year":"1995","unstructured":"J-C. Bermond, F. Comellas, and F. Hsu. Distributed loop computer networks: a survey. Journal of Parallel and Distributed Computing, 24:2\u201310, 1995. 217","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"22_CR4","series-title":"Technical report","volume-title":"Recognizing bipartite incident-graphs of circulant digraphs","author":"J. Cohen","year":"1999","unstructured":"J. Cohen, P. Fraigniaud, and C. Gavoille. Recognizing bipartite incident-graphs of circulant digraphs. Technical report, Laboratoire de Recherche en Informatique, http:\/\/www.lri.fr\/~pierre Univ. Paris-Sud, France, 1999. 224, 225"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1137\/0221010","volume":"21","author":"G. Cybenko","year":"1992","unstructured":"G. Cybenko, D.W. Krumme, and K.N. Venkataraman. Gossiping in minimum time. SIAM Journal on Computing, 21(1):111\u2013139, 1992. 215, 216","journal-title":"SIAM Journal on Computing"},{"key":"22_CR6","first-page":"229","volume":"9","author":"B. Elspas","year":"1970","unstructured":"B. Elspas and J. Turner. Graphs with circulant adjacency matrices. J. Comb. Theory, 9:229\u2013240, 1970. 217","journal-title":"J. Comb. Theory"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"S. Even and B. Monien. On the number of rounds necessary to disseminate information. In First ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1989. 215, 216","DOI":"10.1145\/72935.72969"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"P. Fraigniaud and E. Lazard. Methods and Problems of Communication in Usual Networks. Discrete Applied Mathematics, 53:79\u2013133, 1994. 215","journal-title":"Discrete Applied Mathematics"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S.M. Hedetniemi","year":"1986","unstructured":"S.M. Hedetniemi, S.T. Hedetniemi, and A. Liestman. A survey of gossiping and broadcasting in communication networks. Networks, 18:319\u2013349, 1986. 215","journal-title":"Networks"},{"key":"22_CR10","unstructured":"M-C. Heydemann, N. Marlin, and S. P\u00efrennes. Cayley graphs with complete rotations. Technical Report 1155, LRI, B\u00e2t. 490, Univ. Paris-Sud, 91405 Orsay cedex, lFrance, 1997. Submitted to the European Journal of Combinatorics. 224, 225"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u0107, R. Klasing, B. Monien, and R. Peine. Dissemination of information in interconnection networks (broadcasting and gossiping). In Ding-Zhu Du and D. Frank Hsu, editors, Combinatorial Network Theory, pages 125\u2013212. Kluwer Academic, 1995. 215","DOI":"10.1007\/978-1-4757-2491-2_5"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0012-365X(75)90090-4","volume":"13","author":"W. Knodel","year":"1975","unstructured":"W. Knodel. New gossips and telephones. Discrete Mathematics, 13:95, 1975. 215, 216","journal-title":"Discrete Mathematics"},{"key":"22_CR13","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/0012-365X(94)90290-9","volume":"126","author":"R. Labahn","year":"1994","unstructured":"R. Labahn and I. Warnke. Quick gossiping by telegraphs. Discrete Mathematics, 126:421\u2013424, 1994. 215","journal-title":"Discrete Mathematics"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"B. Mans, F. Pappalardi, and I. Shparlinski. On the \u00c1d\u00e1m conjecture on circulant graphs. In Fourth Annual International Computing and Combinatorics Conference (Cocoon\u2019 98), Lecture Notes in Computer Science. Springer-Verlag, 1998. 217","DOI":"10.1007\/3-540-68535-9_29"},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"M. Muzychuk and G. Tinhoffer. Recognizing circulant graphs of prime order in polynomial time. The electronic journal of combinatorics, 3, 1998. 217","DOI":"10.37236\/1363"},{"key":"22_CR16","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/0020-0190(95)00121-R","volume":"55","author":"A. Nayak","year":"1995","unstructured":"A. Nayak, V. Accia, and P. Gissi. A note on isomorphic chordal rings. Information Processing Letters, 55:339\u2013341, 1995. 217","journal-title":"Information Processing Letters"},{"key":"22_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00053383","volume":"29","author":"I. Ponomarenko","year":"1992","unstructured":"I. Ponomarenko. Polynomial-time algorithms for recognizing and isomorphisn testing of cyclic tournaments. Acta Applicandae Mathematicae, 29:139\u2013160, 1992. 217","journal-title":"Acta Applicandae Mathematicae"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(93)90180-V","volume":"42","author":"V.S. Sunderam","year":"1993","unstructured":"V.S. Sunderam and P. Winkler. Fast information sharing in a distributed system. Discrete Applied Mathematics, 42:75\u201386, 1993. 215","journal-title":"Discrete Applied Mathematics"}],"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\/3-540-46784-X_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T03:41:11Z","timestamp":1587440471000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}