On the hardness of inclusion-wise minimal separators enumeration

Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingl...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Information processing letters Ročník 185; s. 106469
Hlavní autori: Brosse, Caroline, Defrain, Oscar, Kurita, Kazuhiro, Limouzy, Vincent, Uno, Takeaki, Wasa, Kunihiro
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.03.2024
Predmet:
[formula omitted]-hardness
Combinatorial problems
Inclusion-wise minimal separators
Minimal separators
Output-sensitive enumeration
NP-hardness
Combinatorial problems
Output-sensitive enumeration
Inclusion-wise minimal separators
Minimal separators
ISSN:0020-0190, 1872-6119
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Enumeration problems are often encountered as key subroutines in the exact computation of graph parameters such as chromatic number, treewidth, or treedepth. In the case of treedepth computation, the enumeration of inclusion-wise minimal separators plays a crucial role. However and quite surprisingly, the complexity status of this problem has not been settled since it has been posed as an open direction by Kloks and Kratsch in 1998. Recently at the PACE 2020 competition dedicated to treedepth computation, solvers have been circumventing that by listing all minimal a-b separators and filtering out those that are not inclusion-wise minimal, at the cost of efficiency. Naturally, having an efficient algorithm for listing inclusion-wise minimal separators would drastically improve such practical algorithms. In this note, however, we show that no efficient algorithm is to be expected from an output-sensitive perspective, namely, we prove that there is no output-polynomial time algorithm for inclusion-wise minimal separators enumeration unless P=NP. •The problem of listing not all minimal separators but inclusion-wise minimal separators finds motivations in the quest of fast implementations for exact treedepth computation.•Deciding if a graph G has an inclusion-wise minimal separator of size at least 4 is NP-complete.•There is no output-polynomial time algorithm for enumerating inclusion-wise minimal separators unless P=NP.
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2023.106469