scientific article; zbMATH DE number 919282

zbMATH Open0860.90054MaRDI QIDQ4888946FDOQ4888946

Authors: Artem Pyatkin 

Publication date: 9 March 1997

Title of this publication is not available (Why is that?)

Recommendations

• Graph endpoint coloring and distributed processing
• Scheduling transmissions in a network
• Data transfers in networks
• OPTIMUM SCHEDULE PROBLEMS IN STORE AND FORWARD NETWORKS
• Optimal channel allocation for several types of cellular radio networks

zbMATH Keywords

local communication networkoptimal schedule for information transmission

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Communication networks in operations research (90B18)

Cited In (7)

• Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
• On an interval \((1, 1)\)-coloring of incidentors of interval colorable graphs
• Title not available (Why is that?)
• Multicoloring the incidentors of a weighted directed multigraph
• On \((1,l)\)-coloring of incidentors of multigraphs
• On list incidentor \((k,l)\)-coloring
• Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4888946)