An approximation algorithm for K-best enumeration of minimal connected edge dominating sets with cardinality constraints

K-best enumeration, which asks to output k-best solutions without duplication, is a helpful tool in data analysis for many fields. In such fields, graphs typically represent data. Thus subgraph enumeration has been paid much attention to such fields. However, k-best enumeration tends to be intractab...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 1005; S. 114628
Hauptverfasser:	Kurita, Kazuhiro, Wasa, Kunihiro
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 24.07.2024
Schlagworte:	Approximate algorithm Connected edge dominating set K-best enumeration Output-sensitive enumeration Output-sensitive enumeration Connected edge dominating set Approximate algorithm K-best enumeration
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!