Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Cube-Connected Circulants as Efficient Models for Interconnection Networks
View through CrossRef
We introduce cube-connected circulants as efficient models for communication networks. We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant. We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph. Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants. We show cube-connected circulants outperform a few well-known network structures in several invariants.
Title: Cube-Connected Circulants as Efficient Models for Interconnection Networks
Description:
We introduce cube-connected circulants as efficient models for communication networks.
We give an algorithm for computing a shortest path between any pair of vertices in a cube-connected circulant.
We give formulas for the diameter of a cube-connected circulant and the distance between any pair of vertices in such a graph.
Then we give an embedding of cube-connected circulants into hypercubes, and an embedding of hypercubes into cube-connected circulants.
We show cube-connected circulants outperform a few well-known network structures in several invariants.
Related Results
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract P4-01-06: Evaluation of 3D T2-weighted Breast MRI
Abstract
Background: Although the dynamic contrast enhanced (DCE) sequence has long been considered the most important sequence to characterize benign and malignant ...
XXII.—The Theory of Circulants from 1900 to 1920
XXII.—The Theory of Circulants from 1900 to 1920
In contributions to the theory of circulants this twenty-year period is found to have been still more fruitful than its fruitful predecessor, the number of writings belonging to it...
k-super cube root cube mean labeling of graphs
k-super cube root cube mean labeling of graphs
Consider a graph G with |V (G)| = p and |E(G)| = q and let f : V (G) → {k, k + 1, k + 2, . . . p + q + k − 1}} be an injective function. The induced edge labeling f ∗ for a vertex ...
The data cube system to EO datasets: the DCS4COP project
The data cube system to EO datasets: the DCS4COP project
<p>Earth Observation (EO) data availability is drastically increasing thanks to the Copernicus Sentinel missions. In 2014 Sentinel data volumes were approximately 200...
A METHODOLOGY FOR PHYSICAL INTERCONNECTION DECISIONS OF NEXT GENERATION TRANSPORT NETWORKS
A METHODOLOGY FOR PHYSICAL INTERCONNECTION DECISIONS OF NEXT GENERATION TRANSPORT NETWORKS
The physical interconnection for optical transport networks has critical relevance in the overall network performance and deployment costs. As telecommunication services and techno...
Skeletal representations of orthogonal shapes
Skeletal representations of orthogonal shapes
Skeletal representations are important shape descriptors which encode topological and geometrical properties of shapes and reduce their dimension. Skeletons are used in several fie...
The upper connected edge geodetic number of a graph
The upper connected edge geodetic number of a graph
For a non-trivial connected graph G, a set S ? V (G) is called an edge
geodetic set of G if every edge of G is contained in a geodesic joining some
pair of vertices in S. The...
CFD Simulation of the Airflow Distribution Inside Cube-Grow
CFD Simulation of the Airflow Distribution Inside Cube-Grow
Cube-Grow was developed by MARDI to promote urban agriculture to the urban population. The product enables urban people to grow their vegetables with limited space. The initial tes...