Biclique Reconfiguration in Bipartite Graphs
Fuente:
arXiv
Salvato in:
| Autori principali: | , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866911691499896832 |
|---|---|
| author | Otachi, Yota Toyoda, Emi |
| author_facet | Otachi, Yota Toyoda, Emi |
| contents | We prove that Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete. This implies the PSPACE-completeness of the spanning variant of Subgraph Reconfiguration under the token jumping rule for the property "a graph is an $(i, j)$-complete bipartite graph," which was previously known only to be NP-hard [Hanaka et al. TCS 2020]. Using our result, we also show that Connected Components Reconfiguration with two connected components is PSPACE-complete under all previously studied rules, resolving an open problem of Nakahata [COCOON 2025] in the negative. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_17706 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Biclique Reconfiguration in Bipartite Graphs Otachi, Yota Toyoda, Emi Data Structures and Algorithms We prove that Balanced Biclique Reconfiguration on bipartite graphs is PSPACE-complete. This implies the PSPACE-completeness of the spanning variant of Subgraph Reconfiguration under the token jumping rule for the property "a graph is an $(i, j)$-complete bipartite graph," which was previously known only to be NP-hard [Hanaka et al. TCS 2020]. Using our result, we also show that Connected Components Reconfiguration with two connected components is PSPACE-complete under all previously studied rules, resolving an open problem of Nakahata [COCOON 2025] in the negative. |
| title | Biclique Reconfiguration in Bipartite Graphs |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2603.17706 |