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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 88; číslo 1; s. 8
Hlavní autori:	Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2026 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!