Polynomial-time solvability of Directed Plane Strong Connectivity Augmentation
Statement
Let be a connected plane digraph and let be an integer. The Directed Plane Strong Connectivity Augmentation problem asks whether there is a set with such that is strongly connected, directed, and plane for the same embedding of . Directed-PSCA conjecture. The Directed Plane Strong Connectivity Augmentation problem is polynomial-time solvable. The paper establishes fixed-parameter tractability for this problem, while polynomial-time solvability remains open.
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.