On Hamiltonian cycles as optimal p-cycles

Using Hamiltonian p-cycles, it can be shown that p-cycle design is able to reach the logical redundancy bound of 1/(d~-1) where d~ is the average node degree. We formulate two conditions on which the design is able to reach this bound if and only if Hamiltonian p-cycles are used.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE communications letters 2005-04, Vol.9 (4), p.360-362
1. Verfasser: Schupke, D.A.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Using Hamiltonian p-cycles, it can be shown that p-cycle design is able to reach the logical redundancy bound of 1/(d~-1) where d~ is the average node degree. We formulate two conditions on which the design is able to reach this bound if and only if Hamiltonian p-cycles are used.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2005.1413634