Scheduling File Transfers for Trees and Odd Cycles
From MaRDI portal
Recommendations
Cited in
(19)- Data transfers in networks
- On \(f\)-colorings of nearly bipartite graphs
- Some graphs of class 1 for \(f\)-colorings
- Scheduling data transfers in a network and the set scheduling problem
- On minimizing dataset transfer time in an acyclic network with four servers
- The Complexity of File Transfer Scheduling with Forwarding
- Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
- On the fractional f-chromatic index of a graph
- The topology aware file distribution problem
- scientific article; zbMATH DE number 436076 (Why is no real title available?)
- A note on M2-edge colorings of graphs
- Scheduling File Transfers
- SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
- scientific article; zbMATH DE number 1161267 (Why is no real title available?)
- scientific article; zbMATH DE number 1979520 (Why is no real title available?)
- Scheduling data transfers in a network and the set scheduling problem
- scientific article; zbMATH DE number 1929963 (Why is no real title available?)
- Data transfers in networks with transceivers
- \(\mathrm{M}_2\)-edge colorings of cacti and graph joins
This page was built for publication: Scheduling File Transfers for Trees and Odd Cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3774935)