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.
Moore, Naomi Nishimura, Vi- jay Subramanya, Akira Suzuki, and Krishna Vaidyanathan
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Gray-box operators enable RLS to achieve expected O(n log n) runtime for proper 2-colorings in bipartite graphs, unlike standard (1+1) EA which requires plateau guidance.
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.