arXiv (All)
open access
Finding Shortest Reconfiguration Sequences on Independent Set Polytopes
We initiate the study of the shortest reconfiguration problem for independent sets under the adjacency relation derived from the independent set polytope. Given a graph and two independent sets, the problem asks for a shortest sequence transforming one into the other such that the subgraph induced b
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Retained-Set Descent for Diagonal Ramsey Numbers#1084471
- On a problem concerning $\mathbb Z_3$-Ramsey numbers#1064332
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#635641
- Construction of Kochen-Specker Sets from Mutually Unbiased Bases#633292
- Reflection of optimal supports for k-wise independent bits#1061233
Record · ID 820440
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive