Abstract
This chapter is of auxiliary nature. It contains a number of facts from various areas of modern discrete mathematics. This information is widely used in further consideration.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Tanaev, V.S., Gordon, V.S., Shafransky, Y.M. (1994). Elements of Graph Theory and Computational Complexity of Algorithms. In: Scheduling Theory. Single-Stage Systems. Mathematics and Its Applications, vol 284. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1190-4_2
Download citation
DOI: https://doi.org/10.1007/978-94-011-1190-4_2
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4520-9
Online ISBN: 978-94-011-1190-4
eBook Packages: Springer Book Archive