Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,528,822 papers from all fields of science
Search
Sign In
Create Free Account
Cube-connected cycles
Known as:
CCC
, Cube-Connected cycle
In graph theory, the cube-connected cycles is an undirected cubic graph, formed by replacing each vertex of a hypercube graph by a cycle. It was…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
13 relations
Bitwise operation
Book embedding
Circular shift
Crossing number (graph theory)
Expand
Broader (1)
Network topology
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
On the Pagenumber of the Cube-Connected Cycles
Yuuki Tanaka
,
Y. Shibata
International Workshop on Combinatorial…
2010
Corpus ID: 11830437
In this manuscript, we treat the book embedding of the cube-connected cycles. The book embedding of graphs is one of the graph…
Expand
2008
2008
Resource Placement in Cube-Connected Cycles
Paria Moinzadeh
,
H. Sarbazi-Azad
,
N. Yazdani
International Symposium on Parallel Architectures…
2008
Corpus ID: 8881465
In large systems, economical and efficiency concerns restrict the allocation of each resource to every node in the network…
Expand
2006
2006
A perfect load balancing algorithm on cube-connected cycles
G. Jan
,
S. Leu
,
Cheng-Hung Li
,
Xiaoshe Dong
2006
Corpus ID: 14310541
A simple yet efficient algorithm was presented by Jan and Huang recently to distribute loads evenly on multiprocessor computers…
Expand
2005
2005
Novel broadcasting schemes on cube-connected cycles
Jywe-Fei Fang
,
Chun-Mei Lee
,
Erh-Ying Yen
,
Ruei-Xi Chen
,
Yilin Feng
PACRIM. IEEE Pacific Rim Conference on…
2005
Corpus ID: 11771427
Broadcasting which is a primitive communication problem is to distribute the same message from a source node to all other nodes…
Expand
2001
2001
Layout of the Cube-connected Cycles without Long Wires
Guihai Chen
,
F. Lau
Computer/law journal
2001
Corpus ID: 8796673
Preparata and Vuillemin proposed the cube-connected cycles (CCC) in 1981, and in the same paper gave an asymptotically-optimal…
Expand
2000
2000
Tighter Layouts of the Cube-Connected Cycles
Guihai Chen
,
F. Lau
IEEE Trans. Parallel Distributed Syst.
2000
Corpus ID: 6152830
F.P. Preparata and J. Vuillemin (1981) proposed the cube-connected cycles (CCC) and its compact layout. We give a new layout of…
Expand
2000
2000
An optimal multicast algorithm for cube-connected cycles
Jianping Song
,
Z. Hou
,
Shi Yuntao
Journal of Computational Science and Technology
2000
Corpus ID: 10745778
This paper presents an efficient algorithm that implements one-to-many, or multicast, communication in one-port wormhole-routed…
Expand
1993
1993
A Reliable Cube-Connected Cycles Structure
N. Tzeng
J. Parallel Distributed Comput.
1993
Corpus ID: 2804196
Abstract In this paper, we propose a new reliable structure for the cube-connected cycles (CCC) implemented by VLSI/WSI…
Expand
1992
1992
Load Balancing and Routing on the Hypercube and Related Networks
J. JáJá
,
K. Ryu
J. Parallel Distributed Comput.
1992
Corpus ID: 37964283
1990
1990
Compressing cube-connected cycles and butterfly networks
R. Klasing
,
Reinhard Lüling
,
B. Monien
Proceedings of the Second IEEE Symposium on…
1990
Corpus ID: 18975887
The authors consider the simulation of large cube-connected cycles (CCC) large butterfly networks (BFN) on smaller ones, a…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE