article · 1993

Ring Embedding in an Injured Hypercube

Cited by 10Abstract and details only

Abstract

We consider the problem of embedding a ring in a hypercube that contains possible faulty nodes. Existing algorithms allow the number of faulty nodes to be at most 2n-\Theta(\sqrt {nlogn}), where n is the dimension of the hypercube. We propose an embedding scheme that can tolerate up to \Theta(2^{n/2}) faulty nodes, largely increasing the number of tolerable faulty nodes in a ring embedding.

Cite this paper

APA 7

Tseng, Y., & Lai, T. (1993). Ring Embedding in an Injured Hypercube. https://doi.org/10.1109/icpp.1993.159

MLA 9

Tseng, Yu‐Chee, and Ten‐Hwang Lai. “Ring Embedding in an Injured Hypercube.” vol. i, 1993, pp. 149–52, https://doi.org/10.1109/icpp.1993.159.

Chicago

Tseng, Yu‐Chee, and Ten‐Hwang Lai. 1993. “Ring Embedding in an Injured Hypercube.” https://doi.org/10.1109/icpp.1993.159.

Harvard

Tseng, Y. and Lai, T. (1993) ‘Ring Embedding in an Injured Hypercube’. Available at: https://doi.org/10.1109/icpp.1993.159.

BibTeX

@article{tseng1993ring,
  title = {{Ring Embedding in an Injured Hypercube}},
  author = {Tseng, Yu‐Chee and Lai, Ten‐Hwang},
  volume = {i},
  pages = {149--152},
  year = {1993},
  doi = {10.1109/icpp.1993.159}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.

Ring Embedding in an Injured Hypercube

Abstract

Cite this paper

Embedding meshes into cubes

Embedding of Simple Cycles in Hypercubes