{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:51:02Z","timestamp":1725558662001},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651956"},{"type":"electronic","value":"9783540494942"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":[[1998]]},"DOI":"10.1007\/10692760_19","type":"book-chapter","created":{"date-parts":[[2010,6,30]],"date-time":"2010-06-30T16:35:37Z","timestamp":1277915737000},"page":"227-241","source":"Crossref","is-referenced-by-count":8,"title":["Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition"],"prefix":"10.1007","author":[{"given":"G.","family":"Gauyacq","sequence":"first","affiliation":[]},{"given":"C.","family":"Micheneau","sequence":"additional","affiliation":[]},{"given":"A.","family":"Raspaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","first-page":"115","volume":"50","author":"B. Alspach","year":"1984","unstructured":"Alspach, B.: Discrete Mathematics. Problems\u00a050, 115 (1984)","journal-title":"Problems"},{"key":"19_CR2","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1976","unstructured":"Berge, C.: Graphs and Hypergraphs, 2nd edn. North-Holland, Amsterdam (1976)","edition":"2"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0020-0190(94)00087-5","volume":"51","author":"D. Barth","year":"1994","unstructured":"Barth, D., Raspaud, A.: Two disjoint Hamiltonian cycles in the butterfly graph. Inf. Proc. Letters\u00a051, 175\u2013179 (1994)","journal-title":"Inf. Proc. Letters"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/0095-8956(89)90040-3","volume":"46","author":"J.C. Bermond","year":"1989","unstructured":"Bermond, J.C., Favaron, O., Maheo, M.: Hamiltonian decomposition of Cayley graphs of degree 4. J. Comb. Th. B\u00a046, 142\u2013153 (1989)","journal-title":"J. Comb. Th. B"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TIT.1987.1057290","volume":"39","author":"F.R.K. Chung","year":"1987","unstructured":"Chung, F.R.K., Coffman, E.G., Reiman, M.I., Simon, B.: The forwarding index of communication Networks. IEEE Transactions on Information Theory\u00a039(2), 224\u2013232 (1987)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1-3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(95)00072-5","volume":"156","author":"S.J. Curran","year":"1996","unstructured":"Curran, S.J., Gallian, J.A.: Hamiltonian cycles and paths in Cayley graphs and digraphs. Discrete Math.\u00a0156(1-3), 1\u201318 (1996)","journal-title":"Discrete Math."},{"unstructured":"Gauyacq, G.: Routages uniformes dans les graphe sommet-transitifs, Phd Thesis, LaBRI, Universit\u00e9 Bordeaux I, France (1995)","key":"19_CR7"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0166-218X(89)90022-X","volume":"23","author":"M.C. Heydemann","year":"1989","unstructured":"Heydemann, M.C., Meyer, J.C., Sotteau, D.: On forwarding indices of networks. Discrete Applied Maths\u00a023, 103\u2013123 (1989)","journal-title":"Discrete Applied Maths"},{"doi-asserted-by":"crossref","unstructured":"Leighton, F.T.: Introduction to Parallel Algorithms and Architecture: arrays, trees, hypercubes. Morgan Kaufman Publisher, San Francisco (1992)","key":"19_CR9","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0012-365X(94)90381-6","volume":"131","author":"J. Liu","year":"1994","unstructured":"Liu, J.: Hamiltonian decompositions of Cayley graphs on abelian groups. Discrete Math.\u00a0131, 163\u2013171 (1994)","journal-title":"Discrete Math."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0020-0190(97)00020-3","volume":"61","author":"C. Micheneau","year":"1997","unstructured":"Micheneau, C.: Disjoint Hamiltonian cycles in recursive circulant graphs. Inf. Proc. Letters\u00a061, 259\u2013264 (1997)","journal-title":"Inf. Proc. Letters"},{"unstructured":"Micheneau, C.: Graphes r\u00e9cursifs circulants, communication vagabondes et simulation, Phd Thesis, LaBRI, Universit\u00e9 Bordeaux I, France (1996)","key":"19_CR12"},{"unstructured":"Park, J.-H., Chwa, K.-Y.: Recursive circulant: A new topology for multicomputer networks. In: Proc. Int. Symp. Parallel Architectures, Algorithms and Networks ISPAN 1994, Japan, pp. 73\u201380. IEEE, Los Alamitos (1994)","key":"19_CR13"},{"unstructured":"de Rumeur, J.: Communications dans les reseaux de processeurs. Masson (1994)","key":"19_CR14"}],"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\/10692760_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T12:05:56Z","timestamp":1635595556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10692760_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651956","9783540494942"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/10692760_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}
