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

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!