A multi-tree routing scheme using acyclic orientations
From MaRDI portal
Publication:1575452
DOI10.1016/S0304-3975(99)00244-3zbMath0945.68008MaRDI QIDQ1575452
Publication date: 21 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- The multi-tree approach to reliability in distributed networks
- Independent branchings in acyclic digraphs
- Reliable broadcasting in product networks
- Three tree-paths
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Directional Routing via Generalized st-Numberings
- Disproof of a conjecture about independent branchings in k‐connected directed graphs