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...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 185; p. 106469
Main Authors:	Brosse, Caroline, Defrain, Oscar, Kurita, Kazuhiro, Limouzy, Vincent, Uno, Takeaki, Wasa, Kunihiro
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.03.2024
Subjects:	[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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!