{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:39:47Z","timestamp":1725896387320},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102165"},{"type":"electronic","value":"9783642102172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10217-2_46","type":"book-chapter","created":{"date-parts":[[2009,11,9]],"date-time":"2009-11-09T15:52:03Z","timestamp":1257781923000},"page":"471-477","source":"Crossref","is-referenced-by-count":1,"title":["Antibandwidth of d-Dimensional Meshes"],"prefix":"10.1007","author":[{"given":"L\u2019ubom\u00edr","family":"T\u00f6r\u00f6k","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vrt\u2019o","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1137\/060660291","volume":"22","author":"R. Akhtar","year":"2008","unstructured":"Akhtar, R., Jiang, T., Miller, Z.: Asymptotic determination of edge-bandwidth of multidimensional grids and Hamming graphs. SIAM Journal on Discrete Mathematics\u00a022, 425\u2013449 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"46_CR2","volume-title":"Combinatorics of Finite Sets","author":"I. Anderson","year":"1987","unstructured":"Anderson, I.: Combinatorics of Finite Sets. Oxford University Press, New York (1987)"},{"key":"46_CR3","unstructured":"Bezrukov, S.L., Piotrowski, V.P.: Shadows and isoperimetry in bipartite graphs. Presented at SIAM Conference on Discrete Mathematics, Minneapolis (2000)"},{"key":"46_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0097-3165(91)90021-8","volume":"56","author":"B. Bollob\u00e1s","year":"1991","unstructured":"Bollob\u00e1s, B., Leader, I.: Compressions and isoperimetric inequalities. Journal of Combinatorial Theory A\u00a056, 47\u201362 (1991)","journal-title":"Journal of Combinatorial Theory A"},{"key":"46_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0166-218X(96)00076-5","volume":"75","author":"B. Bollob\u00e1s","year":"1997","unstructured":"Bollob\u00e1s, B., Leader, I.: Matchings and paths in the cube. Discrete Applied Mathematics\u00a075, 1\u20138 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/j.endm.2006.06.028","volume":"24","author":"T. Calmoneri","year":"2006","unstructured":"Calmoneri, T., Massini, A., T\u00f6r\u00f6k, \u013d., Vrt\u2019o, I.: Antibandwidth of complete k-ary trees. Electronic Notes in Discrete Mathematics\u00a024, 259\u2013266 (2006)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"46_CR7","unstructured":"Cappanera, P.: A survey on obnoxious facility location problems. Technical Report TR-99-11, Dipartimento di Informatica, Uni. di Pisa (1999)"},{"key":"46_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.2307\/2690829","volume":"64","author":"D. Chakerian","year":"1991","unstructured":"Chakerian, D., Logothetti, D.: Cube slices, pictorial triangles, and probability. Mathematics Magazine\u00a064, 219\u2013241 (1991)","journal-title":"Mathematics Magazine"},{"key":"46_CR9","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0012-365X(98)00346-X","volume":"202","author":"S. Donnely","year":"1999","unstructured":"Donnely, S., Isaak, G.: Hamiltonian powers in treshold and arborescent comparability graphs. Discrete Mathematics\u00a0202, 33\u201344 (1999)","journal-title":"Discrete Mathematics"},{"key":"46_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J. D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Computing Surveys\u00a034, 313\u2013356 (2002)","journal-title":"ACM Computing Surveys"},{"key":"46_CR11","unstructured":"Gallian, J.A.: Graph labeling. Electronic Journal on Combinatorics, DS6 (2005)"},{"key":"46_CR12","first-page":"262","volume":"37","author":"F. G\u00f6bel","year":"1994","unstructured":"G\u00f6bel, F.: The separation number. Ars Combinatoria\u00a037, 262\u2013274 (1994)","journal-title":"Ars Combinatoria"},{"key":"46_CR13","doi-asserted-by":"publisher","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"60","author":"W.K. Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proceedings of IEEE\u00a060, 1497\u20131514 (1980)","journal-title":"Proceedings of IEEE"},{"key":"46_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1097-0118(199805)28:1<31::AID-JGT3>3.0.CO;2-G","volume":"28","author":"G. Isaak","year":"1998","unstructured":"Isaak, G.: Powers of Hamiltonian paths in interval graphs. J. Graph Theory\u00a028, 31\u201338 (1998)","journal-title":"J. Graph Theory"},{"key":"46_CR15","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1137\/0213040","volume":"13","author":"J.Y.-T. Leung","year":"1984","unstructured":"Leung, J.Y.-T., Vornberger, O., Witthoff, J.D.: On some variants of the bandwidth minimization problem. SIAM J. Computing\u00a013, 650\u2013667 (1984)","journal-title":"SIAM J. Computing"},{"key":"46_CR16","first-page":"1","volume":"35","author":"L. Yixun","year":"2003","unstructured":"Yixun, L., Jiang, Y.J.: The dual bandwidth problem for graphs. J. Zhengzhou Univ. Nat. Sci. Ed.\u00a035, 1\u20135 (2003)","journal-title":"J. Zhengzhou Univ. Nat. Sci. Ed."},{"key":"46_CR17","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1002\/net.3230190604","volume":"19","author":"Z. Miller","year":"1989","unstructured":"Miller, Z., Pritikin, D.: On the separation number of a graph. Networks\u00a019, 651\u2013666 (1989)","journal-title":"Networks"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"3541","DOI":"10.1016\/j.disc.2007.12.058","volume":"309","author":"A. Raspaud","year":"2009","unstructured":"Raspaud, A., Schr\u00f6der, H., S\u00fdkora, O., T\u00f6r\u00f6k, L., Vrt\u2019o, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics\u00a0309, 3541\u20133552 (2009)","journal-title":"Discrete Mathematics"},{"key":"46_CR19","doi-asserted-by":"crossref","unstructured":"Jiang, T., Miller, Z., Pritikin, D.: Separation numbers of trees. Theoretical Computer Science (to appear)","DOI":"10.1016\/j.tcs.2009.05.011"},{"key":"46_CR20","unstructured":"T\u00f6r\u00f6k, \u013d., Vrt\u2019o, I.: Antibandwidth of three-dimensional meshes. Discrete Mathematics (to appear)"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"1947","DOI":"10.1016\/j.dam.2008.12.004","volume":"157","author":"X. Wang","year":"2009","unstructured":"Wang, X., Wu, X., Dumitrescu, S.: On explicit formulas for bandwidth and antibandwidth of hypercubes. Discrete Applied Mathematics\u00a0157, 1947\u20131952 (2009)","journal-title":"Discrete Applied Mathematics"},{"key":"46_CR22","unstructured":"Weili, Y., Ju, Z., Xiaoxu, L.: Dual bandwidth of some special trees. J. Zhengzhou Univ. Nat. Sci. Ed.\u00a035 (2003)"},{"key":"46_CR23","first-page":"421","volume":"12","author":"P. Yu","year":"1997","unstructured":"Yu, P.: The separation numbers of two classes of graphs. J. Changsha Univ. Electr. Power Nat. Sci. Ed.\u00a012, 421\u2013426 (1997)","journal-title":"J. Changsha Univ. Electr. Power Nat. Sci. Ed."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10217-2_46.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:34:36Z","timestamp":1619782476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10217-2_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102165","9783642102172"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10217-2_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}