Pages that link to "Item:Q1109560"
From MaRDI portal
The following pages link to The multi-tree approach to reliability in distributed networks (Q1109560):
Displaying 23 items.
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Four Edge-Independent Spanning Trees (Q3130452) (← links)
- Finding Totally Independent Spanning Trees with Linear Integer Programming (Q3195324) (← links)
- Performance and Reliability of Tree-Structured Grid Services Considering Data Dependence and Failure Correlation (Q4564187) (← links)
- Detection Performance of the Majority Dominance Rule in $m$ -Ary Relay Trees With Node and Link Failures (Q4621659) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← links)
- (Q4703869) (← links)
- Linking-Centers and Reliable-Trees of a Network (Q4721051) (← links)
- Constructing Node-Independent Spanning Trees in Augmented Cubes (Q4988941) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← links)
- The <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"><mml:mi>k</mml:mi></mml:math>-independence number of graph products (Q5198005) (← links)
- Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks (Q5374226) (← links)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- Independent tree spanners: Fault-tolerant spanning trees with constant distance guarantees (Q5928871) (← links)
- Independent spanning trees with small depths in iterated line digraphs (Q5936460) (← links)
- Independent spanning trees in crossed cubes (Q5971214) (← links)
- On mixed connectivity certificates (Q6102287) (← links)
- Edge-independent spanning trees in folded crossed cubes (Q6168082) (← links)
- Independent spanning trees of product graphs (Q6550556) (← links)
- \((t, s)\)-completely independent spanning trees (Q6575408) (← links)
- Strongly proper connected coloring of graphs (Q6621951) (← links)
- Every 2-connected \(\{\text{claw}, Z_2\}\)-free graph with minimum degree at least 4 contains two CISTs (Q6648248) (← links)
- Vertex-independent spanning trees in complete Josephus cubes (Q6652471) (← links)