• DocumentCode
    3163694
  • Title

    Analysis of the modified even networks

  • Author

    Madabhushi, S.V.R. ; Lakshmivarahan, S. ; Dhall, S.K.

  • Author_Institution
    Parallel Processing Inst., Oklahoma Univ., Norman, OK, USA
  • fYear
    1991
  • fDate
    2-5 Dec 1991
  • Firstpage
    128
  • Lastpage
    131
  • Abstract
    The authors introduce a class of networks based on Gδ graphs that are subgraphs of the binary hypercubes and even networks. For this class of networks, the authors present (a) complete characterization of the node disjoint (parallel) paths, (b) a strategy for tracing a Hamiltonian cycle in Gδ, and (c) an optimal algorithm for single source broadcast of data packets using a greedy spanning tree
  • Keywords
    graph theory; hypercube networks; multiprocessor interconnection networks; trees (mathematics); Gδ graphs; Hamiltonian cycle; binary hypercubes; data packets; even networks; greedy spanning tree; modified even networks; node disjoint; optimal algorithm; single source broadcast; Binary trees; Bipartite graph; Broadcasting; Computer science; Fault tolerance; Hypercubes; Multidimensional systems; Multiprocessor interconnection networks; Parallel processing; Routing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing, 1991. Proceedings of the Third IEEE Symposium on
  • Conference_Location
    Dallas, TX
  • Print_ISBN
    0-8186-2310-1
  • Type

    conf

  • DOI
    10.1109/SPDP.1991.218288
  • Filename
    218288
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3163694