Pages that link to "Item:Q338381"
From MaRDI portal
The following pages link to Constructing two completely independent spanning trees in hypercube-variant networks (Q338381):
Displaying 12 items.
- Improving the diameters of completely independent spanning trees in locally twisted cubes (Q1621502) (← links)
- Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees (Q1693138) (← links)
- Constructing dual-CISTs with short diameters using a generic adjustment scheme on bicubes (Q2043017) (← links)
- Three completely independent spanning trees of crossed cubes with application to secure-protection routing (Q2053847) (← links)
- Augmenting a tree to a \(k\)-arbor-connected graph with pagenumber \(k\) (Q2115870) (← links)
- Reliability analysis based on the dual-CIST in shuffle-cubes (Q2242055) (← links)
- A well-equalized 3-CIST partition of alternating group graphs (Q2281160) (← links)
- Constructing dual-CISTs of DCell data center networks (Q2286061) (← links)
- A two-stages tree-searching algorithm for finding three completely independent spanning trees (Q2317871) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5918548) (← links)
- Constructing tri-CISTs in shuffle-cubes (Q5925687) (← links)
- A recursive algorithm for constructing dual-CISTs in hierarchical folded cubic networks (Q6569892) (← links)
