Metraipolis › archive › dc_4aae7181bc60

Solving Vertex Integrity Faster than $2^n$ — arXiv:2609.33779

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.33779
License (as archived)
CC0-1.0
Archived
2026-10-08T00:18:58.906Z
SHA-256 of the archived text
90b8b9d5ded72b333d0b64bd4e28aefa963e03c66d070086ce2fdcabd5ffc383
Stable URL of this page
https://metraipolis.com/documento/dc_4aae7181bc60

How to cite

Solving Vertex Integrity Faster than $2^n$ — arXiv:2609.33779 — arXiv (en), https://arxiv.org/abs/2609.33779 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4aae7181bc60 (Metraipolis archive dc_4aae7181bc60, sha256 90b8b9d5ded72b333d0b64bd4e28aefa963e03c66d070086ce2fdcabd5ffc383)
BibTeX
@misc{dc4aae7181bc60,
  title = {Solving Vertex Integrity Faster than $2^n$ — arXiv:2609.33779},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.33779},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4aae7181bc60; sha256 90b8b9d5ded72b333d0b64bd4e28aefa963e03c66d070086ce2fdcabd5ffc383},
  year = {2026}
}

Archived text

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

Vertex Integrity is a classical graph parameter measuring the vulnerability of a network to vertex failures. We settle two fundamental questions concerning its exact exponential complexity. First, we prove that, unless the Exponential Time Hypothesis fails, Vertex Integrity has no $2^{o(n)}n^{O(1)}$-time algorithm. Secondly, we give a deterministic exact algorithm running in $O(1.9602^n)$ time and space, improving the straightforward $O(2^n)$ bound.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-29 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2609.33779 — 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-07T23:56:21.768Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-29?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).