arXiv (All)
open access
Parameterised algorithms for temporally satisfying reconfiguration problems
Given a static vertex-selection problem (e.g. independent set, dominating set) on a graph, we can define a corresponding temporally satisfying reconfiguration problem on a temporal graph which asks for a sequence of solutions to the vertex-selection problem at each time such that we can reconfigure
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
- IGP Flexible Algorithms Reverse Affinity Constraint#132390
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#670409
- Resource-Aware Quantum Programming with General Recursion and Quantum Control#668344
- Reduction of the group isomorphism problem to the group automorphism problem#984832
- Block-Wise Variational Quantum Algorithms for PDEs with Interface Penalty Constraints#1131911
Record · ID 984831
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