IEICE TRANSACTIONS on Information
An O (|E|)Hypercube Recognition Algorithm
Summary :
The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. This paper is concerned with the following basic graph-theoretic question: given a graph G = (V, E), is it an exact n-cube? We propose an O (|E|) hypercube recognition algorithm using some new topological properties of the hypercube graph.
- Publication
- IEICE TRANSACTIONS on Information Vol.E79-D No.7 pp.994-996
- Publication Date
- 1996/07/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Algorithm and Computational Complexity
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Won-Ho CHUNG, Cheol-Hoon LEE, Doohun EUM, "An O (|E|)Hypercube Recognition Algorithm" in IEICE TRANSACTIONS on Information,
vol. E79-D, no. 7, pp. 994-996, July 1996, doi: .
Abstract: The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. This paper is concerned with the following basic graph-theoretic question: given a graph G = (V, E), is it an exact n-cube? We propose an O (|E|) hypercube recognition algorithm using some new topological properties of the hypercube graph.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_7_994/_p
Copy
@ARTICLE{e79-d_7_994,
author={Won-Ho CHUNG, Cheol-Hoon LEE, Doohun EUM, },
journal={IEICE TRANSACTIONS on Information},
title={An O (|E|)Hypercube Recognition Algorithm},
year={1996},
volume={E79-D},
number={7},
pages={994-996},
abstract={The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. This paper is concerned with the following basic graph-theoretic question: given a graph G = (V, E), is it an exact n-cube? We propose an O (|E|) hypercube recognition algorithm using some new topological properties of the hypercube graph.},
keywords={},
doi={},
ISSN={},
month={July},}
Copy
TY - JOUR
TI - An O (|E|)Hypercube Recognition Algorithm
T2 - IEICE TRANSACTIONS on Information
SP - 994
EP - 996
AU - Won-Ho CHUNG
AU - Cheol-Hoon LEE
AU - Doohun EUM
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 7
JA - IEICE TRANSACTIONS on Information
Y1 - July 1996
AB - The n-dimensional hypercube is a highly concurrent loosely coupled multiprocessor based on the binary n-cube topology. This paper is concerned with the following basic graph-theoretic question: given a graph G = (V, E), is it an exact n-cube? We propose an O (|E|) hypercube recognition algorithm using some new topological properties of the hypercube graph.
ER -
English
