Abstract
The problem of constructing an optimal schedule of information transmission in a local communication network is reduced to the problem of finding a mixed coloring of the edges in a directed multigraph with the least possible number of colors. Two algorithms for the latter problem are presented. The term “mixed coloring” means that some of the edges can be splitted into two parts and be colored in two colors so that the number of the color of the first part does not exceed the number of the color of the second part.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Holyer (1981) The NP-completeness of edge-coloring, SIAM J. Comput. 10, No. 4, 718–720.
V. G. Vizing (1964) On an estimate for the chromatic class of a p-graph (in Russian), Diskret Anal 3, 25–30.
V. G. Vizing (1965) Critical graphs of a given chromatic class (in Russian), Diskret Anal 5, 9–17.
V. G. Vizing (1965) The chromatic class of a multigraph (in Russian), Kiber netika (Kiev) No. 3, 29–39.
A. A. Zykov (1987) Fundamentals of Graph Theory (in Russian), Nauka, Moscow.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Pyatkin, A.V. (1997). Some Optimization Problems of Scheduling the Transmission of Messages in a Local Communication Network. In: Operations Research and Discrete Analysis. Mathematics and Its Applications, vol 391. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5678-3_17
Download citation
DOI: https://doi.org/10.1007/978-94-011-5678-3_17
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-6395-1
Online ISBN: 978-94-011-5678-3
eBook Packages: Springer Book Archive