IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v39y2020i3d10.1007_s10878-020-00521-3.html
   My bibliography  Save this article

Linear time algorithms for finding independent spanning trees on pyramid networks

Author

Listed:
  • Shuo-I Wang

    (Taiwan Police College)

  • Fu-Hsing Wang

    (Chinese Culture University)

Abstract

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.

Suggested Citation

  • Shuo-I Wang & Fu-Hsing Wang, 2020. "Linear time algorithms for finding independent spanning trees on pyramid networks," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 826-848, April.
    • Handle: RePEc:spr:jcomop:v:39:y:2020:i:3:d:10.1007_s10878-020-00521-3
    DOI: 10.1007/s10878-020-00521-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-020-00521-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-020-00521-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yu-Huei Chang & Jinn-Shyong Yang & Sun-Yuan Hsieh & Jou-Ming Chang & Yue-Li Wang, 2017. "Construction independent spanning trees on locally twisted cubes in parallel," Journal of Combinatorial Optimization, Springer, vol. 33(3), pages 956-967, April.
    2. Shih-Shun Kao & Kung-Jui Pai & Sun-Yuan Hsieh & Ro-Yu Wu & Jou-Ming Chang, 2019. "Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 972-986, October.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.

      Corrections

      All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:39:y:2020:i:3:d:10.1007_s10878-020-00521-3. See general information about how to correct material in RePEc.

      If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

      If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

      If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

      For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

      Please note that corrections may take a couple of weeks to filter through the various RePEc services.

      IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.