Constructing the nearly shortest path in crossed cubes

  • Authors:

  • Pao-Lien Lai;Hong-Chun Hsu

  • Affiliations:

  • Department of Computer Science and Information Engineering, National Dong Hwa University, Shoufeng, Hualien 97401, Taiwan, ROC;Department of Medical Informatics, Tzu Chi University, Hualien 970, Taiwan, ROC

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2009

Quantified Score

Hi-index 0.07

Visualization

Abstract

A graph G is panconnected if each pair of distinct vertices u,v@?V(G) are joined by a path of length l for all d"G(u,v)=