arXiv (All)
open access
Sublinear Edge Fault-Tolerant Hyperspanners for Hypergraphs
In this paper, we initiate the study on fault-tolerant (FT) graph spanners for hypergraphs and show the generalization to hypergraphs in the FT setting is non-trivial. An FT spanner approximates shortest distances under network failures, widely used in applications such as routing and distributed co
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
- Sublinear Edge Fault-Tolerant Hyperspanners for Hypergraphs#797267
- Safe Hypergraph Contraction via Capacity-Aware Repair Certificates#1156949
- HNSW with Accuracy Guarantees Using Graph Spanners -- A Technical Report#332529
- Polynomial Lower Bounds for Distributed Graph Sketching with Tiny Error: Connectivity and Spanning Tree Construction#973425
- Operation-Type-Aware Client Routing for Leader-Based Consensus Datastores#819841
Record · ID 798681
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