Linear time algorithms for finding independent spanning trees on pyramid networks

  • 4 Accesses


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. Cheriyan and Maheshwari (J Algorithms 9:507–537, 1988) showed that, for any 3-connected graph, 3-ISTs rooted at any vertex can be found in O(|V||E|) time. In this paper, we propose linear time algorithms that solved 3-ISTs rooted at an arbitrary vertex of pyramid networks.

This is a preview of subscription content, log in to check access.

Access options

Buy single article

Instant unlimited access to the full article PDF.

US$ 39.95

Price includes VAT for USA

Subscribe to journal

Immediate online access to all issues from 2019. Subscription will auto renew annually.

US$ 99

This is the net price. Taxes to be calculated in checkout.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6


  1. Bao F, Funyu Y, Hamada Y, Igarashi Y (1998) Reliable broadcasting and secure distributing in channel networks. IEICE Trans Fundam Electron Commun Comput Sci E81-A:796–806

  2. Chang J-M, Wang J-D, Yang J-S, Pai K-J (2014) A comment on “Independent spanning trees in crossed cubes”. Inf Process Lett 114:734–739

  3. Chang Y-H, Yang J-S, Wang Y-L (2017) Construction independent spanning trees on locally twisted cubes in parallel. J Combin Optim 33:956–967

  4. Cheng B, Fan J, Jia X-H, Zhang S-K (2013a) Independent spanning trees in crossed cubes. Inf Sci 233:276–289

  5. Cheng B, Fan J, Jia X-H, Zhang S-K, Chen B-G (2013b) Constructive algorithm of independent spanning trees on möbius cubes. Comput J 56:1347–1362

  6. Cheng B, Fan J, Lyu Q, Zhou J, Liu Z (2018) Constructing independent spanning trees with height \(n\) on the \(n\)-dimensional crossed cube. Future Gener Comput Syst 87:404–415

  7. Cheriyan J, Maheshwari S-N (1988) Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. J Algorithms 9:507–537

  8. Culler D-E, Singh J-P, Gupta A (1999) Parallel computer architecture: a hardware/software approach. Morgan Kaufmann, San Francisco

  9. Hamada Y (2016) Independent spanning trees of 2-chordal rings. IEICE Trans Fundam Electron Commun Comput Sci E99-A:355–362

  10. Kao S-S, Pai K-J, Hsieh S-Y, Wu R-Y, Chang J-M (2019) Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks. J Combin Optim 38:972–986

  11. Liu Y-J, Lan J-K, Chou W-Y, Chen C-Y (2011) Constructing independent spanning trees for locally twisted cubes. Theoret Comput Sci 412:2237–2252

  12. Liu Y, Chou W-Y, Lan J-K, Chen C-Y (2009) Constructing independent spanning trees for hypercubes and locally twisted cubes. In: Proceedings of the 10th international symposium on pervasive systems, algorithms, and networks, Kaohsiung, pp 17–22

  13. Miura K, Nakano S, Nishizeki T, Takahashi D (1999) A linear-time algorithm to find four independent spanning trees in four connected planar graphs. Int J Found Comput Sci 10:195–210

  14. Nagai S, Nakano S-I (2001) A linear-time algorithm to find independent spanning trees in maximal planar graphs. IEICE Trans Fundam Electron Commun Comput Sci E84-A:1102–1109

  15. Shahhoseini H-S, Kandzi E-S, Mollajafari M (2014) Nonflat surface level pyramid: a high connectivity multidimensional interconnection network. J Supercomput 67(1):31–46

  16. Tang S-M, Wang Y-L, Leu Y-H (2004) Optimal independent spanning trees on hypercubes. J Inf Sci Eng 20(1):143–155

  17. Tang S-M, Yang J-S, Wang Y-L, Chang J-M (2010) Independent spanning trees on multidimensional torus networks. IEEE Trans Comput 59(1):93–102

  18. Wang S-I, Wang F-H (2017) Independent spanning trees in RTCC-pyramids. Comput J 60:13–26

  19. Wang Y, Fan J, Han Y-J (2011) An algorithm to find optimal independent spanning trees on twisted-cubes. In: Proceedings of the 4th international symposium on parallel architectures algorithms and programming, pp 52–56

  20. Wang Y, Fan J, Jia X, Huang H (2012) An algorithm to construct independent spanning trees on parity cubes. Theoret Comput Sci 465:61–72

  21. Werapun J, Intakosum S, Boonjing V (2012) An efficient parallel construction of optimal independent spanning trees on hypercubes. J Parallel Distrib Comput 72:1713–1724

  22. Yang J-S, Chang J-M, Tang S-M, Wang Y-L (2009) On the independent spanning trees of recursive circulant graphs \(G(cd^m; d)\) with \(d>2\). Theoret Comput Sci 410:2001–2010

  23. Zhang Y-H, Hao W, Xiang T (2013) Independent spanning trees in crossed cubes. Inf Process Lett 113:653–658

Download references


This work was supported in part by the Ministry of Science and Technology of the Republic of China under the Contract No. MOST 104-2221-E-034-001. The author gratefully acknowledges the helpful comments and suggestions of the reviewers, which have improved the presentation and have strengthened the contribution.

Author information

Correspondence to Fu-Hsing Wang.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Wang, S., Wang, F. Linear time algorithms for finding independent spanning trees on pyramid networks. J Comb Optim (2020) doi:10.1007/s10878-020-00521-3

Download citation


  • Independent spanning trees
  • Interconnection networks
  • Pyramid networks
  • Graph algorithms