Scheduling File Transfers for Trees and Odd Cycles

DOI10.1137/0216013zbMath0635.68023OpenAlexW1984939896MaRDI QIDQ3774935

S. Louis Hakimi, Hyeong-Ah Choi

Publication date: 1987

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0216013

zbMATH Keywords

complexityschedulingnetworksNP-completeapproximation algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

Data transfers in networks ⋮ A note on M2-edge colorings of graphs ⋮ \(\mathrm{M}_2\)-edge colorings of cacti and graph joins ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles ⋮ On the fractionalf-chromatic index of a graph

This page was built for publication: Scheduling File Transfers for Trees and Odd Cycles