The 2-disjoint path problem for circulant digraphs

MaRDI QIDQ5447600zbMATH OpenFDO

Authors

Publication date 20 March 2008

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38)

Recommendations

• STACS 2004
• Solving the 2-disjoint paths problem in nearly linear time
• The Directed Disjoint Shortest Paths Problem
• Two disjoint shortest paths problem with non-negative edge length
• The undirected two disjoint shortest paths problem

Cited in

(5)

• On the problem of finding disjoint cycles and dicycles in a digraph
• Disjoint paths and k-wide diameter of circulants with degree 4
• scientific article; zbMATH DE number 867679 (Why is no real title available?)
• scientific article; zbMATH DE number 1409242 (Why is no real title available?)
• An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem

This page was built for publication: The 2-disjoint path problem for circulant digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5447600)