arXiv (All)
open access
Temporal Graph Reconfiguration for Always-Connected Graphs
Network redesign problems ask for modifications to the edges of a given graph to satisfy certain properties. In temporal graphs, where edges are only active at certain times, we are sometimes only allowed to modify when the edges are going to be active. In practice, we might not even be able to perf
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
- Worst-Case Optimal BGPs on Temporal Graphs#394501
- The Temporal Bias Approach to the Symmetry Problem and Historical Closeness#705261
- Can the Future Influence the Past? A Philosophical Analysis of Retrocausality#96409
- The directed temporal exploration problem#1119412
- Layer-Based Width for PAFP#819368
Record · ID 1218340
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