arXiv (All)
open access
Independent Set Reconfiguration via Dilworth Decompositions
The Token Jumping and Sliding Token problems are fundamental reconfiguration problems defined on the independent sets of an undirected graph. Given two independent sets $I$ and $J$, each of size $k$, these problems ask whether there exists a sequence of elementary operations transforming $I$ into $J
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
- Variable Stepsize Distributed Forward-Backward Splitting Methods as Relocated Fixed-Point Iterations#1052079
- The Erdős-Pósa Property for Colorful Minors#971921
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#635508
- On the Termination Problem for Probabilistic Higher-Order Recursive Programs#633159
- Tokenisation via Convex Relaxations#216806
Record · ID 1050913
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