2002 | OriginalPaper | Buchkapitel
Distances
verfasst von : Jørgen Bang-Jensen, PhD, Gregory Gutin, MSc, PhD
Erschienen in: Digraphs
Verlag: Springer London
Enthalten in: Professional Book Archive
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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.