scientific article; zbMATH DE number 4103110
From MaRDI portal
Publication:3828033
[For the entire collection see Zbl 0656.00008.] The necessary and sufficient condition for the solvability of a directed version of the edge-disjoint path problem is established for some special classes of digraphs. In addition, the directed counterparts of two theorems concerned with the connectivity of Eulerian graphs due to \textit{L. Lovasz} [Acta Math. Acad. Sci. Hungar. 28, 129-138 (1976; Zbl 0337.05124)] are proved.
Recommendations
Cited in
(15)- Eulerian detachments with local edge-connectivity
- Analysis of the Held-Karp lower bound for the asymmetric TSP
- Paths and circuits in partially directed graphs
- Splitting off edges between two subsets preserving the edge-connectivity of the graph.
- A fast algorithm for the path 2-packing problem
- Free multiflows in bidirected and skew-symmetric graphs
- Routing in undirected graphs with constant congestion
- scientific article; zbMATH DE number 6379051 (Why is no real title available?)
- Euler digraphs
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- The Directed Minimum Latency Problem
- The directed orienteering problem
- Weak Three-Linking in Eulerian Dgraphs
- Two arc disjoint paths in Eulerian digraphs
- On duality and fractionality of multicommodity flows in directed networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3828033)