Linear time algorithms for finding independent spanning trees on pyramid networks † - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2016

Linear time algorithms for finding independent spanning trees on pyramid networks †

Shuo-I Wang
  • Fonction : Auteur
  • PersonId : 994213
Fu-Hsing Wang
  • Fonction : Auteur correspondant
  • PersonId : 994214

Connectez-vous pour contacter l'auteur

Résumé

The use of independent spanning trees (ISTs) has scientific applications in fault-tolerant requirement in network protocols and secure message distributions. Most of the designs of ISTs are for those interconnection networks with vertex symmetric property, implying that one can find ISTs rooted on a designated vertex, and, by the vertex symmetry property of the given network, hence have solved the ISTs problem on any arbitrary vertex. The existence of asymmetry makes the ISTs problem even harder than its symmetric counterpart. In this paper, we propose linear time algorithms that solved 3-ISTs rooted at an arbitrary vertex of pyramid networks.
Fichier principal
Vignette du fichier
pyramidQ.pdf (512.15 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01402110 , version 1 (24-11-2016)

Identifiants

  • HAL Id : hal-01402110 , version 1

Citer

Shuo-I Wang, Fu-Hsing Wang. Linear time algorithms for finding independent spanning trees on pyramid networks †. 2016. ⟨hal-01402110⟩
36 Consultations
107 Téléchargements

Partager

Gmail Facebook X LinkedIn More