Fault tolerance of the star graph interconnection network
From MaRDI portal
Publication:1318765
DOI10.1016/0020-0190(94)90092-2zbMath0795.68012OpenAlexW1967367179MaRDI QIDQ1318765
Publication date: 5 April 1994
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)90092-2
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)
Related Items
Node-to-set disjoint paths problem in star graphs ⋮ Node-to-node cluster fault tolerant routing in star graphs ⋮ Minimum time broadcast in faulty star networks ⋮ THE PERMUTATIONAL GRAPH: A NEW NETWORK TOPOLOGY ⋮ Deterministic Models of Communication Faults ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
Cites Work