SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS

DOI10.1142/S0129054193000079zbMath0802.68015OpenAlexW2028616122MaRDI QIDQ4286114

Shin-ichi Nakano, Takao Nishizeki

Publication date: 27 April 1994

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054193000079

zbMATH Keywords

edge-coloring of multigraphsfile transfer scheduling

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

Edge-colouring of joins of regular graphs. I ⋮ On $g_c$-colorings of nearly bipartite graphs ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Some properties on \(f\)-edge covered critical graphs ⋮ A note on the \((g, f)\)-coloring ⋮ Fractional \(f\)-edge cover chromatic index of graphs ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

This page was built for publication: SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS