
Constructing edge-disjoint spanning trees in twisted cubes
Keywords: الگوریتم ها; Algorithms; Edge-disjoint spanning trees; Independent spanning trees; Data broadcasting; Fault-tolerance; Twisted cubes; Interconnection networks