Metraipolis › archive › dc_52dc85a6e67d
A smaller kernel for Ptolemaic Vertex Deletion — arXiv:2611.01062
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01062
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:58:52.242Z
- SHA-256 of the archived text
9c5d8198132754ce38adc3169b989a79e40107a6cce48a8b0a91022d81bc3ec2- Stable URL of this page
https://metraipolis.com/documento/dc_52dc85a6e67d
How to cite
A smaller kernel for Ptolemaic Vertex Deletion — arXiv:2611.01062 — arXiv (en), https://arxiv.org/abs/2611.01062 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_52dc85a6e67d (Metraipolis archive dc_52dc85a6e67d, sha256 9c5d8198132754ce38adc3169b989a79e40107a6cce48a8b0a91022d81bc3ec2)
BibTeX
@misc{dc52dc85a6e67d,
title = {A smaller kernel for Ptolemaic Vertex Deletion — arXiv:2611.01062},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01062},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_52dc85a6e67d; sha256 9c5d8198132754ce38adc3169b989a79e40107a6cce48a8b0a91022d81bc3ec2},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01062. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In the Ptolemaic Vertex Deletion problem, the input consists of an undirected graph $G$ and an integer $k$. The goal is to decide whether there is a set of at most $k$ vertices whose removal from $G$ results in a Ptolemaic graph. In this paper, we give a kernel for Ptolemaic Vertex Deletion with $O(k^5)$ vertices. Our result improves upon the $O(k^6)$ kernel of Agrawal et al. [IPEC 2021]. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2611.01062 — 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-11-03T18:18:07.710Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).