Parameterized Dynamic Cluster Editing

We introduce a dynamic version of the NP-hard graph modification problem Cluster Editing . The essential point here is to take into account dynamically evolving input graphs: having a cluster graph (that is, a disjoint union of cliques) constituting a solution for a first input graph, can we cost-ef...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 83; H. 1; S. 1 - 44
Hauptverfasser:	Luo, Junjie, Molter, Hendrik, Nichterlein, André, Niedermeier, Rolf
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2021 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Clustering Computer Science Computer Systems Organization and Communication Networks Data search Data Structures and Information Theory Distance measurement Editing Graphs Mathematics of Computing Parameterization Theory of Computation Local search Goal-oriented clustering NP-hard problems Correlation clustering Incremental clustering Graph-based data clustering Compromise clustering Multi-choice knapsack Fixed-parameter tractability Parameterized complexity Kernelization
ISSN:	0178-4617, 1432-0541
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!