ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let DD be a connected plane digraph and let kk be an integer. The Directed Plane Strong Connectivity Augmentation problem asks whether there is a set X⊆V(D)2X\subseteq V(D)^2 with ∣X∣≤k|X|\leq k such that D+XD+X is strongly connected, directed, and plane for the same embedding of DD. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.