Parks and Recreation: Color Fault-Tolerant Spanners Made Local
Fuente:
arXiv
Saved in:
| Main Authors: | Parter, Merav, Petruschka, Asaf, Sapir, Shay, Tzalik, Elad |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
by: Parter, Merav, et al.
Published: (2025)
by: Parter, Merav, et al.
Published: (2025)
Connectivity Labeling in Faulty Colored Graphs
by: Petruschka, Asaf, et al.
Published: (2024)
by: Petruschka, Asaf, et al.
Published: (2024)
Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
by: Parter, Merav, et al.
Published: (2024)
by: Parter, Merav, et al.
Published: (2024)
New Oracles and Labeling Schemes for Vertex Cut Queries
by: Jiang, Yonggang, et al.
Published: (2025)
by: Jiang, Yonggang, et al.
Published: (2025)
Greedy Completion for Weighted $(α,β)$-Spanners
by: Tzalik, Elad
Published: (2026)
by: Tzalik, Elad
Published: (2026)
Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
by: Chuzhoy, Julia, et al.
Published: (2026)
by: Chuzhoy, Julia, et al.
Published: (2026)
New Greedy Spanners and Applications
by: Popova, Elizaveta, et al.
Published: (2026)
by: Popova, Elizaveta, et al.
Published: (2026)
Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
by: Bhanja, Koustav, et al.
Published: (2025)
by: Bhanja, Koustav, et al.
Published: (2025)
Fault-Equivalent Lowest Common Ancestors
by: Petruschka, Asaf
Published: (2024)
by: Petruschka, Asaf
Published: (2024)
All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
by: Fischer, Orr, et al.
Published: (2025)
by: Fischer, Orr, et al.
Published: (2025)
The Power of Recursive Embeddings for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2025)
by: Krauthgamer, Robert, et al.
Published: (2025)
Sublinear Edge Fault Tolerant Spanners for Hypergraphs
by: He, Jialin, et al.
Published: (2025)
by: He, Jialin, et al.
Published: (2025)
New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
by: Gil, Yuval, et al.
Published: (2025)
by: Gil, Yuval, et al.
Published: (2025)
Distributed Interactive Proofs for Planarity with Log-Star Communication
by: Gil, Yuval, et al.
Published: (2025)
by: Gil, Yuval, et al.
Published: (2025)
Light Edge Fault Tolerant Graph Spanners
by: Bodwin, Greg, et al.
Published: (2025)
by: Bodwin, Greg, et al.
Published: (2025)
Approximate Light Spanners in Planar Graphs
by: Le, Hung, et al.
Published: (2025)
by: Le, Hung, et al.
Published: (2025)
On the Adversarial Robustness of Online Importance Sampling
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
by: Kenneth-Mordoch, Yotam, et al.
Published: (2025)
Optimal Fault-Tolerant Spanners in Euclidean and Doubling Metrics: Breaking the $Ω(\log n)$ Lightness Barrier
by: Le, Hung, et al.
Published: (2023)
by: Le, Hung, et al.
Published: (2023)
Distributed Maximum Flow in Planar Graphs
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
by: Abd-Elhaleem, Yaseen, et al.
Published: (2024)
Moderate Dimension Reduction for $k$-Center Clustering
by: Jiang, Shaofeng H. -C., et al.
Published: (2023)
by: Jiang, Shaofeng H. -C., et al.
Published: (2023)
Optimal Bounds for Spanners and Tree Covers in Doubling Metrics
by: La, An, et al.
Published: (2025)
by: La, An, et al.
Published: (2025)
Routing-Controlled Spanners
by: Grigorescu, Elena, et al.
Published: (2024)
by: Grigorescu, Elena, et al.
Published: (2024)
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Directed Buy-at-Bulk Spanners
by: Grigorescu, Elena, et al.
Published: (2024)
by: Grigorescu, Elena, et al.
Published: (2024)
Fault-Tolerant Bounded Flow Preservers
by: Bansal, Shivam, et al.
Published: (2024)
by: Bansal, Shivam, et al.
Published: (2024)
Fault-Tolerant ST-Diameter Oracles
by: Bilò, Davide, et al.
Published: (2023)
by: Bilò, Davide, et al.
Published: (2023)
Graph Spanners for Group Steiner Distances
by: Bilò, Davide, et al.
Published: (2024)
by: Bilò, Davide, et al.
Published: (2024)
Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)
by: Casteigts, Arnaud, et al.
Published: (2026)
Multiplicative Spanners in Minor-Free Graphs
by: Bodwin, Greg, et al.
Published: (2025)
by: Bodwin, Greg, et al.
Published: (2025)
Almost-Optimal Sublinear Additive Spanners
by: Tan, Zihan, et al.
Published: (2023)
by: Tan, Zihan, et al.
Published: (2023)
A Unified Framework for Hopsets and Spanners
by: Neiman, Ofer, et al.
Published: (2021)
by: Neiman, Ofer, et al.
Published: (2021)
Shortcuts and Transitive-Closure Spanners Approximation
by: Chalermsook, Parinya, et al.
Published: (2025)
by: Chalermsook, Parinya, et al.
Published: (2025)
Dimension Reduction for Clustering: The Curious Case of Discrete Centers
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)
by: Jiang, Shaofeng H. -C., et al.
Published: (2025)
Nearly Optimal Fault Tolerant Distance Oracle
by: Dey, Dipan, et al.
Published: (2024)
by: Dey, Dipan, et al.
Published: (2024)
An Optimal $3$-Fault-Tolerant Connectivity Oracle
by: Kosinas, Evangelos
Published: (2025)
by: Kosinas, Evangelos
Published: (2025)
A Simple Dynamic Spanner via APSP
by: Kyng, Rasmus, et al.
Published: (2024)
by: Kyng, Rasmus, et al.
Published: (2024)
Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
by: Ghaffari, Mohsen, et al.
Published: (2025)
by: Ghaffari, Mohsen, et al.
Published: (2025)
Improved Sublinear Algorithms for Classical and Quantum Graph Coloring
by: Ferber, Asaf, et al.
Published: (2025)
by: Ferber, Asaf, et al.
Published: (2025)
Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
by: Le, Hung, et al.
Published: (2021)
by: Le, Hung, et al.
Published: (2021)
Towards Instance-Optimal Euclidean Spanners
by: Le, Hung, et al.
Published: (2024)
by: Le, Hung, et al.
Published: (2024)
Similar Items
-
Color Fault-Tolerant Distance Preservers: Õptimal Size in Conditionally Õptimal Time
by: Parter, Merav, et al.
Published: (2025) -
Connectivity Labeling in Faulty Colored Graphs
by: Petruschka, Asaf, et al.
Published: (2024) -
Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
by: Parter, Merav, et al.
Published: (2024) -
New Oracles and Labeling Schemes for Vertex Cut Queries
by: Jiang, Yonggang, et al.
Published: (2025) -
Greedy Completion for Weighted $(α,β)$-Spanners
by: Tzalik, Elad
Published: (2026)