From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem

Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular. Interestingly, these problems can be equivalently formulated as classical graph problems on induced subgraphs of power...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Algorithmica Jg. 88; H. 1; S. 8
Hauptverfasser:	Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.02.2026 Springer Nature B.V
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Clustering Complexity Computer Science Computer Systems Organization and Communication Networks Data science Data Structures and Information Theory Graph theory Hypercubes Machine learning Mathematics of Computing Parameterization Parameters Theory of Computation Clustering Data completion Parameterized complexity Independent set problem on hypercubes First Order Logic model checking Diversity
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!