Metraipolis › archive › dc_44da581ee14c

The Cost of Changing Edges for Diameter Computation and More — arXiv:2608.12628

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.12628
License (as archived)
CC0-1.0
Archived
2026-10-19T04:56:57.851Z
SHA-256 of the archived text
1dbd9d52be5ce29db01887c919861dc55a057665331d77fdb78ac62002a5bcf8
Stable URL of this page
https://metraipolis.com/documento/dc_44da581ee14c

How to cite

The Cost of Changing Edges for Diameter Computation and More — arXiv:2608.12628 — arXiv (en), https://arxiv.org/abs/2608.12628 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_44da581ee14c (Metraipolis archive dc_44da581ee14c, sha256 1dbd9d52be5ce29db01887c919861dc55a057665331d77fdb78ac62002a5bcf8)
BibTeX
@misc{dc44da581ee14c,
  title = {The Cost of Changing Edges for Diameter Computation and More — arXiv:2608.12628},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.12628},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_44da581ee14c; sha256 1dbd9d52be5ce29db01887c919861dc55a057665331d77fdb78ac62002a5bcf8},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12628. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The sensitivity setting is a restricted setting for dynamic algorithms, particularly practical for scenarios where extensive preprocessing is feasible but responses to real-time modifications must be near-instantaneous before the data structure is eventually rebuilt. For graph problems, a sensitivity data structure is constructed with a preprocessing time P so that the following queries can be answered quickly, preferably in $O(1)$ time: given an edge $e$, return the answer to the problem on either $G \setminus e$ (decremental) or $G \cup e$ (incremental). We almost entirely settle the decremental setting for the diameter and eccentricities problems in a variety of approximation regimes by matching P to the static runtime while supporting $O(1)$-time queries, thereby improving upon all previous single-failure results [Biló, Cohen, Friedrich, Schirneck, MFCS 2021; Biló, Choudhary, Cohen, Friedrich, Krogmann, Schirneck, ICALP 2023, Algorithmica 2026]. More precisely: (1) We provide a tight reduction demonstrating that any exact distance sensitivity oracle can be used to efficiently solve decremental exact diameter and all-node eccentricities; (2) For the approximate setting, we match the runtime of all known static diameter algorithms across all sparsity settings, up to an additional $1+o(1)$ factor in approximation. Conversely, for the previously unexplored incremental setting of these problems: (3) We develop new lower bounds, demonstrating that no incremental algorithm can efficiently approximate diameter, radius, or eccentricity beyond a $5/3$ factor in undirected graphs or a $2$ factor in directed graphs; (4) We introduce two new instructive techniques and demonstrate how to utilize them to construct several new algorithms. Most notably, we develop incremental single-node eccentricity approximations for both directed and undirected graphs that match our new lower bounds.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-14 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.12628 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T04:52:49.849Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-14?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).