• DocumentCode
    690336
  • Title

    Parallel Construction of Binomial-Like Independent Spanning Trees on Twisted Cubes

  • Author

    Yan Wang ; Jianxi Fan ; Wenjun Liu ; Baolei Cheng

  • Author_Institution
    Sch. of Comput. Sci. & Technol., Soochow Univ., Suzhou, China
  • fYear
    2013
  • fDate
    14-15 Dec. 2013
  • Firstpage
    258
  • Lastpage
    261
  • Abstract
    Independent spanning trees(ISTs) have increasing applications in fault-tolerance, reliable communication protocols and secure message distribution. In this paper, we propose an O(N) parallel algorithm to construct n BISTs rooted at any vertex on n-dimensional twisted cube, where BISTs denote the ISTs isomorphic to binomial-like tree and N =2n.
  • Keywords
    multiprocessor interconnection networks; parallel algorithms; trees (mathematics); BISTs; binomial-like independent spanning trees; n-dimensional twisted cube; parallel algorithm; Broadcasting; Computer science; Computers; Educational institutions; Hypercubes; Reliability; Independent spanning trees; binomial-like tree; fault-tolerance; twisted cube;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Sciences and Applications (CSA), 2013 International Conference on
  • Conference_Location
    Wuhan
  • Type

    conf

  • DOI
    10.1109/CSA.2013.66
  • Filename
    6835593
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=690336