Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.
The NP-completeness column: An ongoing guide
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.
citing papers explorer
-
Biclique Reconfiguration in Bipartite Graphs
Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete, implying PSPACE-completeness for spanning subgraph reconfiguration of (i,j)-bicliques and for two-component connected-components reconfiguration under all token rules.
-
Hardness and Approximation for Coloring Digraphs
Establishes n^{1-ε}-hardness of approximation for dichromatic number and acyclic number on tournaments, plus polynomial-time approximations for ℓ-dicolorable digraphs and special dense cases.