Abstract
In this chapter, we study polynomial algorithms which find distances in weighted and unweighted digraphs as well as some related complexity results. We consider bounds on certain distance parameters of a digraph and describe several results on minimizing (and maximizing) the diameter of an orientation of a graph. We study some applications of distances in digraphs to the travelling salesman problem, the one-way street problem and the gossip problem.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag London
About this chapter
Cite this chapter
Bang-Jensen, J., Gutin, G. (2002). Distances. In: Digraphs. Springer, London. https://doi.org/10.1007/978-1-4471-3886-0_2
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3886-0_2
Publisher Name: Springer, London
Print ISBN: 978-1-85233-611-0
Online ISBN: 978-1-4471-3886-0
eBook Packages: Springer Book Archive