{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:44:27Z","timestamp":1648676667457},"reference-count":21,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Inter. Net."],"published-print":{"date-parts":[[2003,3]]},"abstract":"<jats:p> Improved bounds for the crossing number of the mesh of trees graph, M<jats:sub>n<\/jats:sub>, are derived. In particular, we derive a new lower bound of [Formula: see text] which improves on the previous bound of Leighton [11] by a constant factor, and an upper bound of [Formula: see text]. In addition, we construct drawings of M<jats:sub>n<\/jats:sub> which achieve the upper bound number of crossings. We also prove that the crossing number of M<jats:sub>4<\/jats:sub> is 4. <\/jats:p>","DOI":"10.1142\/s0219265903000714","type":"journal-article","created":{"date-parts":[[2003,5,21]],"date-time":"2003-05-21T08:17:16Z","timestamp":1053505036000},"page":"17-35","source":"Crossref","is-referenced-by-count":1,"title":["IMPROVED BOUNDS FOR THE CROSSING NUMBER OF THE MESH OF TREES"],"prefix":"10.1142","volume":"04","author":[{"given":"ROBERT","family":"CIMIKOWSKI","sequence":"first","affiliation":[{"name":"Computer Science Department, Montana State University, Bozeman, Montana 59717-3880, USA"}]},{"given":"IMRICH","family":"VRT'O","sequence":"additional","affiliation":[{"name":"Institute for Informatics, Slovak Academy of Sciences, Bratislava, Slovak Republic"}]}],"member":"219","published-online":{"date-parts":[[2012,1,25]]},"reference":[{"key":"rf1","first-page":"97","volume":"118","author":"Anderson M.","journal-title":"Congressus Numerantium"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90071-0"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190190113"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.2307\/2319261"},{"key":"rf5","first-page":"271","volume":"50","author":"Faria L.","journal-title":"Math. Slovaca"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1137\/0604033"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.4153\/CMB-1965-003-3"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(72)90042-1"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(70)80087-4"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0118(199607)22:3<239::AID-JGT4>3.0.CO;2-N"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1007\/BF01744433"},{"key":"rf12","volume-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton F. T.","year":"1992"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190150109"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086610"},{"key":"rf15","first-page":"195","volume":"9","author":"Pach J.","journal-title":"Geombinatorics"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90014-X"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02086611"},{"key":"rf19","unstructured":"F.\u00a0Shahrokhi, Intuitive Geometry, Bolyai Soc. Math. Studies\u00a06, eds. I.\u00a0Barany and K.\u00a0Boroczky (Akademia Kiado, Budapest, 1997)\u00a0pp. 179\u2013206."},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1007\/BF01989746"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594196"},{"key":"rf22","unstructured":"A. T.\u00a0White and L. W.\u00a0Beineke, Selected Topics in Graph Theory, eds. L. W.\u00a0Beineke and R. J.\u00a0Wilson (Academic Press, 1978)\u00a0pp. 15\u201350."}],"container-title":["Journal of Interconnection Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0219265903000714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T23:33:11Z","timestamp":1565134391000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0219265903000714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":21,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2012,1,25]]},"published-print":{"date-parts":[[2003,3]]}},"alternative-id":["10.1142\/S0219265903000714"],"URL":"https:\/\/doi.org\/10.1142\/s0219265903000714","relation":{},"ISSN":["0219-2659","1793-6713"],"issn-type":[{"value":"0219-2659","type":"print"},{"value":"1793-6713","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}