For which restricted classes of digraphs can the fixed-k edge-disjoint paths problem be solved in polynomial time?
Statement
For which restricted classes of digraphs can the fixed-k edge-disjoint paths problem be solved in polynomial time? Here the input is a digraph G and k terminal pairs, and the task is to decide whether mutually edge-disjoint directed paths connect each pair.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.