arXiv (All)
open access
Constant Factor Optimal 2-Resilient Local Failover Routing Scheme on Directed Graphs
Local failover routing delivers a packet from a source $s$ to a destination $t$ using only pre-computed, per-node forwarding rules together with a small rewritable packet header, remaining correct even when up to $k$ arcs of the network fail. We study this problem on directed graphs with $n$ nodes,
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
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617877
- Geometric Control Theory Over Networks: Minimal Node Cardinality Disturbance Decoupling Problems#617377
- Regularization and complexity control in feed-forward networks#230055
- Stabilization index of V-number of powers of edge ideals of graphs#987968
- An iterative rounding $2$-approximation for Feedback Vertex Set via AI-assisted proof of an extreme point property#927704
Record · ID 1013145
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