Metraipolis › archive › dc_f649fba72b93
Finding non-bisimplicial and triad-free minimal separators — arXiv:2610.19093
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19093
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T21:52:36.766Z
- SHA-256 of the archived text
c87a211ed3677890b5388bde6ea17cb21e9278f91f8979953fccd3005af1fb86- Stable URL of this page
https://metraipolis.com/documento/dc_f649fba72b93
How to cite
Finding non-bisimplicial and triad-free minimal separators — arXiv:2610.19093 — arXiv (en), https://arxiv.org/abs/2610.19093 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f649fba72b93 (Metraipolis archive dc_f649fba72b93, sha256 c87a211ed3677890b5388bde6ea17cb21e9278f91f8979953fccd3005af1fb86)
BibTeX
@misc{dcf649fba72b93,
title = {Finding non-bisimplicial and triad-free minimal separators — arXiv:2610.19093},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19093},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f649fba72b93; sha256 c87a211ed3677890b5388bde6ea17cb21e9278f91f8979953fccd3005af1fb86},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19093. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A $u\hbox{-}v$ separator in $G$ is a set $S\subseteq V(G)\setminus\{u,v\}$ such that there is no $u\hbox{-}v$ path in $G\setminus S$. A minimal separator in $G$ is a set $S$ such that for some $u,v\in V(G)\setminus S$, $S$ is a $u\hbox{-}v$ separator in $G$ but no proper subset of $S$ is. A set $S$ is bisimplicial if it is the union of at most two cliques. Recognizing graphs in which every minimal separator is the union of at most $k$ cliques is polynomial-time solvable for $k=1$ and NP-hard for every fixed $k\geq 3$. We settle the remaining case $k=2$ by giving a polynomial-time algorithm to decide whether every minimal separator in a graph is bisimplicial. A set $S$ is triad-free if its independence number $\alpha(S)$ is at most two. Given a graph $G$ and two vertices $u,v$, the problem of finding a $u\hbox{-}v$ separator $S$ with $\alpha(S)\leq k$ had the same complexity gap: it was known to be polynomial-time solvable for $k=1$ and NP-hard for every fixed $k\geq 3$. We resolve the remaining case $k=2$ by giving a polynomial-time algorithm that finds a triad-free $u\hbox{-}v$ separator or determines that none exists.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO) ; Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.19093 — 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-15T21:37:14.415Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).