Pages that link to "Item:Q1109560"
From MaRDI portal
The following pages link to The multi-tree approach to reliability in distributed networks (Q1109560):
Displayed 34 items.
- A comment on ``Independent spanning trees in crossed cubes'' (Q402393) (← links)
- A plane graph representation of triconnected graphs (Q410724) (← links)
- Computing all the best swap edges distributively (Q436830) (← links)
- Constructing independent spanning trees for locally twisted cubes (Q533862) (← links)
- Independent spanning trees on even networks (Q545379) (← links)
- Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes (Q656593) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Independent spanning trees on twisted cubes (Q663434) (← links)
- On the complexity of computation in the presence of link failures: The case of a ring (Q808251) (← links)
- Constructing edge-disjoint spanning trees in locally twisted cubes (Q1006074) (← links)
- On the independent spanning trees of recursive circulant graphs \(G(cd^m,d)\) with \(d>2\) (Q1019176) (← links)
- Electing a leader in a ring with link failures (Q1075046) (← links)
- Optimal fault-tolerant routings for connected graphs (Q1186600) (← links)
- Forests, frames, and games: Algorithms for matroid sums and applications (Q1186784) (← links)
- On independent spanning trees (Q1198088) (← links)
- On mixed connectivity certificates (Q1274334) (← links)
- Random sampling and greedy sparsification for matroid optimization problems (Q1290633) (← links)
- Independent trees in graphs (Q1323489) (← links)
- Directed \(s\)-\(t\) numberings, rubber bands, and testing digraph \(k\)-vertex connecitivity (Q1343167) (← links)
- Reliable broadcasting in product networks (Q1392523) (← links)
- A multi-tree routing scheme using acyclic orientations (Q1575452) (← links)
- Disjoint paths in arborescences (Q1773369) (← links)
- An algorithm to construct independent spanning trees on parity cubes (Q1929242) (← links)
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs (Q1944080) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Independent spanning trees on folded hyper-stars (Q3064044) (← links)
- Completely independent spanning trees in torus networks (Q4648692) (← links)
- (Q4703869) (← links)
- CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2<sup>m</sup>, 2) (Q5187853) (← 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)