2k-Vertex Kernels for Cluster Deletion and Strong Triadic Closure

Cluster deletion and strong triadic closure are two important NP-complete problems that have received significant attention due to their applications in various areas, including social networks and data analysis. Although cluster deletion and strong triadic closure are closely linked by induced path...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of computer science and technology 2023-12, Vol.38 (6), p.1431-1439
Hauptverfasser:	Gao, Wen-Yu, Gao, Hang
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Analysis Apexes Artificial Intelligence Clusters Computer Science Data analysis Data Structures and Information Theory Deletion Editing Graph theory Graphs Information Systems Applications (incl.Internet) Labeling Lower bounds Regular Paper Social networks Software Engineering Theory of Computation Vertex sets
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!