This paper presents an efficient algorithm that implements one-to-many, or multicast, communication in one-port wormhole-routed cube-connected cycles (CCCs) in the absence of hardware multicast support. By exploiting the properties of the switching technology and the use of virtual channels, a minimum-time multicast algorithm is presented forn-dimensional CCCs that use deterministic routing of unicast messages. The algorithm can deliver a multicast message tom−1 destinations in [log2m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on CCCs with up to 10,240 nodes are also given.