Data transfers in networks

DOI10.1007/BF01762116zbMath0635.68024MaRDI QIDQ1097687

Hyeong-Ah Choi, S. Louis Hakimi

Publication date: 1988

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

schedulingedge-coloringNP-hardpolynomial time algorithmscommunication graphpre-emptiondata transferscommunication modes

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

Improved bounds for the chromatic index of graphs and multigraphs ⋮ Data transfers in networks with transceivers ⋮ ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of edge-coloring in graphs
• Scheduling File Transfers
• Scheduling File Transfers for Trees and Odd Cycles
• Link scheduling in polynomial time
• On Edge Coloring Bipartite Graphs
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Data transfers in networks with transceivers

This page was built for publication: Data transfers in networks