arXiv (All)
open access
Vertex-Failure Distance Oracles and Labeling Schemes: Compact and Constant-Approximate
We present new algorithms for the vertex-failure distance oracles and labeling schemes problems in undirected weighted graphs. A vertex-failure distance oracle is a data structure that, given two vertices $x$ and $y$ and a failed vertex set $F$ of size at most $f$, returns an approximation to the
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
- Efficiently Listing Projected Trees, and Equivalence of Listing and Enumeration#1156377
- An Approximation Algorithm for Graph Label Selection#200497
- Sensitivity Oracles for Matroid Packing, Matroid Covering, and Matching Problems with Applications#821236
- Approximate distance oracles revisited#330525
- Filter Learning for Subgraphs: Algebras and Performance Risk Bounds#394421
Record · ID 1157364
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