Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Fault tolerance of the star graph interconnection network

From MaRDI portal
Publication:1318765
Jump to:navigation, search

DOI10.1016/0020-0190(94)90092-2zbMath0795.68012OpenAlexW1967367179MaRDI QIDQ1318765

Jelena Mišić, Zoran Jovanovic

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


zbMATH Keywords

interconnection networksstar graphmulticomputers


Mathematics Subject Classification ID

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

  • On Group Graphs and Their Fault Tolerance
  • A group-theoretic model for symmetric interconnection networks
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1318765&oldid=13435787"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 13:04.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki