scientific article; zbMATH DE number 4103110

MaRDI QIDQ3828033zbMATH OpenFDO

Authors

Publication date 1989

zbMATH Keywords

connectivitydigraphsedge-disjoint path problemeulerian digraph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Euler digraphs
• Paths and circuits in partially directed graphs
• Two arc disjoint paths in Eulerian digraphs
• Supereulerian digraphs with large arc-strong connectivity
• Degree and local connectivity in digraphs

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)