{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T02:10:12Z","timestamp":1649124612711},"reference-count":12,"publisher":"EDP Sciences","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1993]]},"DOI":"10.1051\/ita\/1993270504651","type":"journal-article","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:17:32Z","timestamp":1486030652000},"page":"465-481","source":"Crossref","is-referenced-by-count":2,"title":["Congestion optimale du plongement de l\u2019hypercube $H (n)$ dans la cha\u00eene $P(2^n)$"],"prefix":"10.1051","volume":"27","author":[{"given":"A.","family":"Bel Hala","sequence":"first","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"1. BHATT S. N. et LEIGHTON F. T., A framework for solving VLSI graph layout problems, J. Comput. System Sci., 28, 1984, p. 300-343.7605490543.68052","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. CHINN P. Z., CHV\u00c1TALOV\u00c1 J., DEWDNEY A. K. et GIBBS N. E., The bandwidth problem for graphs and matrices-A survey, J. Graph Theory, 6, 1982, p. 223-254.6667940494.05057","DOI":"10.1002\/jgt.3190060302"},{"key":"R3","unstructured":"3. CHUNG F. R. K., Labelings of graphs, in Selected Topics in Graph Theory, III (L. Beineke and R. Wilson, Eds.), Academic Press, 1988, p. 151-168.12054000656.05058"},{"key":"R4","unstructured":"4. CHUNG F. R. K. et SEYMOUR P. D., manuscript, Bell Communication Research, Some results on the bandwith and the cutwidth of a graph, 1987."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"5.HARPER L. H., Optimal assignments of numbers to vertices, J. Soc. Indust. Appl. Math. 9 12, 1964, p. 131-135.1627370222.94004","DOI":"10.1137\/0112012"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"6. HARPER L. H., Optimal numberings and isoperimetric problems on graphs, J. of Combinatorial Theory, 1, 1966, p. 385-393.2001920158.20802","DOI":"10.1016\/S0021-9800(66)80059-5"},{"key":"R7","unstructured":"7. HROMKOVIC J., MULLER V., SYKORA O. et VRTO I., On embedding in cycles (to appear).13317300826.68012"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. TEN-HWANG LAI et SPRAGUE Alan P., Placement of the Processors of a Hypercube, IEEE-Trans.-Comput. 40, 6, 1991, p. 714-722.1113977","DOI":"10.1109\/12.90250"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. LEIGHTON , MAGGO , RAO , Universal packet routing algorithms, 29th FOCS, 1988, p. 256-271.","DOI":"10.1109\/SFCS.1988.21942"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"10. MAKEDON F., PAPADIMITRIOU C. H. et SUDBOROUGH I. H., Topological bandwidth, SIAM J. Algebraic Discrete Methods, 6, 1985, p. 418-444.7911720573.05052","DOI":"10.1137\/0606044"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. MONIEN B. et SUDBROUGH I. H., Comparing Interconnection Networks, Proceedings of the 13th Symposium on mathematical Foundations of Computer Science, 1988.","DOI":"10.1007\/BFb0017137"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"12. MONIEN B. et SUDBROUGH I. H., Embedding one Interconnection Network in Another, Computing Suppl., 7, 1990, p. 257-282.10599340699.68017","DOI":"10.1007\/978-3-7091-9076-0_13"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270504651\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T02:01:36Z","timestamp":1568772096000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1993270504651"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":12,"journal-issue":{"issue":"5"},"alternative-id":["ita1993270504651"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1993270504651","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}