Edge-disjoint spanning trees on the star network with applications to fault tolerance

DOI10.1109/12.485370MaRDI QIDQ4420893zbMATH OpenOpenAlexFDO

Authors Selim G. Akl, P. Fragopoulou

Publication date 10 November 2003

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/0bbf792cae57693188b085ba5cc7f0577292e75f

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Fault Tolerance on Star Graphs
• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• Minimum time broadcast in faulty star networks
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.

Cited in

(33)

• On randomized broadcasting in star graphs
• Constructing edge-disjoint spanning trees in locally twisted cubes
• Mutually independent Hamiltonian cycles for the pancake graphs and the star graphs
• The multi-tree approach to reliability in distributed networks
• Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks
• Minimum time broadcast in faulty star networks
• Embedding \(k\)(\(n-k\)) edge-disjoint spanning trees in arrangement graphs.
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• Edges-disjoint spanning trees on the binary wrapped butterfly network with applications to fault tolerance
• A parallel construction of vertex-disjoint spanning trees with optimal heights in star networks
• Constructing edge-disjoint Steiner paths in lexicographic product networks
• Path 3-(edge-)connectivity of lexicographic product graphs
• Broadcasting secure messages via optimal independent spanning trees in folded hypercubes
• Broadcasting in hypercubes and star graphs with dynamic faults.
• Constructing edge-disjoint spanning trees in twisted cubes
• Path-connectivity of lexicographic product graphs
• Node-Disjoint Multipath Spanners and Their Relationship with Fault-Tolerant Spanners
• Fault-free mutually independent Hamiltonian cycles of faulty star graphs
• Independent spanning trees on folded hyper-stars
• Deterministic Models of Communication Faults
• Fault-tolerant extensions of star networks
• Completely independent spanning trees in torus networks
• The generalized 4-connectivity of hypercubes
• Edge-independent spanning trees in augmented cubes
• Constructing internally disjoint pendant Steiner trees in Cartesian product networks
• The super connectivity of the pancake graphs and the super laceability of the star graphs
• Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes
• Reliability analysis of exchanged hypercubes based on the path connectivity
• Independent spanning trees on twisted cubes
• Spanning subgraphs with applications to communication on the multidimensional torus network
• Properties of Euclidean minimum weight (k, )-tight graphs
• On completely edge-independent spanning trees in locally twisted cubes
• On the k-maximally-disjoint weighted spanning trees problem: variants, complexity and algorithms

This page was built for publication: Edge-disjoint spanning trees on the star network with applications to fault tolerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420893)