
...we prove tight bounds for crossing numbers of hypercube and cube connectedcycles (ccc) graphs.key words: crossing number, cube connected cycles, hypercube, lower boundcr categories: f.1.2 [modes of computations] parallelism, g.2.2...

...prove tight bounds for the crossing number of the ndimensional hypercube and cube connected cycles (ccc) graphs....

...in (15) for the outerplanar crossing number (in other terminologies also called convex, circular and onepage book crossing number) to a more general setting...lower bound for the planar crossing number. we exhibit further sequences of graphs, whose outerplanar cross ing number exceeds by a factor of log n the planar crossing...

...compact 2manifold in terms of the crossing number of the complete graph of the same size on the same manifold. the bounds...random graphs. we determine the crossing number of a complete graph, and hence of many other graphs, on a compact 2manifold up...

...improved bounds for the crossing number of the mesh of trees graph, mn, are derived. in particular, we derive a new lower bound of 5n2 log n−44n2 80 ‡...in addition, we construct drawings of mn which achieve the upper bound number of crossings. we also prove that the crossing number of m4 is 4....


hypercubes and cubeconnected cycles differ in the number of links per node which has...derive several lower bound figures and describe algorithms for communication in cubeconnected cycles. we conclude that while having lower number of links per node in a...

...distributions in parallel programming. the cubeconnected cycles (ccc) proposed by preparata and vuillemin are very similar in structure to the hypercube as an efficient generalpurpose...propose a simple algorithm based on our previous work to distribute loads evenly on cubeconnected cycles. this algorithm achieves perfect load...
Published in 2006.

...for packet switching of arbitrary group permutations on the hypercube and arbitrary permutations on the cubeconnected cycles with small number of node channels, methods of conflictless realization were proposed, and their speed was considered....

...new interconnection network, the xcube, a variant of the cubeconnectedcycles (ccc), which has the same degree, and same diameter in the worst...is evaluated experimentally through implementation of the above algorithms. a number of comparisons are made between this network and three existing networks, mesh, hypercube, and the ccc...