Data transfers in networks
type: Item
instance of: scholarly article
title: Data transfers in networks
zbMATH Open document ID: 0635.68024
DOI: 10.1007/BF01762116
author: Hyeong-Ah Choi
author: S. Louis Hakimi
published in: Algorithmica
publication date: 1988-01-01T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 94C15
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 4035125
zbMATH Keywords: communication graph
zbMATH Keywords: scheduling
zbMATH Keywords: edge-coloring
zbMATH Keywords: polynomial time algorithms
zbMATH Keywords: communication modes
zbMATH Keywords: data transfers
zbMATH Keywords: NP-hard
zbMATH Keywords: pre-emption
MaRDI profile type: Publication
cites work: Q3097395
cites work: On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
cites work: Q4087193
cites work: A generalization of edge-coloring in graphs
cites work: Q4073396
cites work: On Edge Coloring Bipartite Graphs
cites work: Scheduling File Transfers
cites work: Q4198056
cites work: Scheduling File Transfers for Trees and Odd Cycles
cites work: Data transfers in networks with transceivers
cites work: Link scheduling in polynomial time
description: scientific article; zbMATH DE number 4035125