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 50 items.
- Independent spanning trees of chordal rings (Q294645) (← links)
- 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)
- Construction of optimal independent spanning trees on folded hypercubes (Q497932) (← links)
- A parallel algorithm for constructing independent spanning trees in twisted cubes (Q505426) (← links)
- Constructing completely independent spanning trees in crossed cubes (Q505430) (← links)
- Edge-independent spanning trees in augmented cubes (Q515545) (← 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)
- A fast parallel algorithm for constructing independent spanning trees on parity cubes (Q668143) (← 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)
- Edge-orders (Q1741850) (← 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)
- Structural properties of subdivided-line graphs (Q2018541) (← links)
- Degree conditions for completely independent spanning trees of bipartite graphs (Q2093107) (← links)
- A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks (Q2110363) (← links)
- A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks (Q2151377) (← links)
- Constructing dual-CISTs of folded divide-and-swap cubes (Q2219061) (← links)
- Parallel construction of multiple independent spanning trees on highly scalable datacenter networks (Q2246461) (← links)
- Broadcasting secure messages via optimal independent spanning trees in folded hypercubes (Q2275932) (← links)
- An improved algorithm to construct edge-independent spanning trees in augmented cubes (Q2306584) (← links)
- Spanning tree packing number and eigenvalues of graphs with given girth (Q2321370) (← links)
- Amortized efficiency of constructing multiple independent spanning trees on bubble-sort networks (Q2331598) (← links)
- Construction independent spanning trees on locally twisted cubes in parallel (Q2359799) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Dimension-adjacent trees and parallel construction of independent spanning trees on crossed cubes (Q2442959) (← links)
- Degree condition for completely independent spanning trees (Q2629776) (← links)
- Constructing edge-disjoint spanning trees in twisted cubes (Q2638205) (← links)
- Two completely independent spanning trees of claw-free graphs (Q2675841) (← links)
- Two completely independent spanning trees of \(P_4\)-free graphs (Q2698533) (← links)
- Monochromatic connectivity and graph products (Q2798325) (← links)
- Mondshein sequences (a.k.a. (2,1)-orders) (Q2832896) (← links)