Abstract
In this chapter we concentrate on problems concerning (arc)-disjoint paths or trees (arborescences). We embark from the 2-path problem which concerns the existence of two disjoint paths with prescribed initial and terminal vertices. We give a proof by Fortune et al. showing that the 2-path problem is NP-complete. We proceed by studying the more general k-path problem for various classes of digraphs. We show that for acyclic digraphs, the k-path problem is polynomially solvable when k is not a part of the input. Then we describe several results on the k-path problem for generalizations of tournaments. Among other results, we show that the 2-path problem is polynomially solvable for digraphs that can be obtained from strong semi-complete digraphs by substituting arbitrary digraphs for each vertex of the semicomplete digraph. We briefly discuss the k-path problem for planar digraphs and indicate how to use the topological concept of planarity in proofs and algorithms for disjoint path problems in planar digraphs.
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). Disjoint Paths and Trees. In: Digraphs. Springer, London. https://doi.org/10.1007/978-1-4471-3886-0_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3886-0_9
Publisher Name: Springer, London
Print ISBN: 978-1-85233-611-0
Online ISBN: 978-1-4471-3886-0
eBook Packages: Springer Book Archive