Sun–Gutin–Yeo–Zhang's computational conjecture for strong subgraph k-connectivity
Statement
Let be a digraph, and let and be fixed integers. The parameter is the maximum, over all -vertex subsets of , of the number of internally vertex-disjoint strong subgraphs containing that subset. Sun–Gutin–Yeo–Zhang's conjecture. It is NP-complete to decide, for fixed integers and and a given digraph , whether . This would extend the established NP-completeness result for the corresponding fixed terminal set parameter to , whose computational complexity is the subject of the conjecture.
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.