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ženo v:
Podrobná bibliografie
Vydáno v:Algorithmica Ročník 88; číslo 1; s. 8
Hlavní autoři: Eiben, Eduard, Ganian, Robert, Kanj, Iyad, Ordyniak, Sebastian, Szeider, Stefan
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.02.2026
Springer Nature B.V
Témata:
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 přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 powers of partially-defined hypercubes. In this paper, we follow up on this recent direction by investigating the Independent Set problem on this graph class, which has been studied in the data science setting under the name Diversity. We obtain a comprehensive picture of the problem’s parameterized complexity and establish its fixed-parameter tractability w.r.t. the solution size plus the power of the hypercube. Given that several such First Order Logic (FO) definable problems have been shown to be fixed-parameter tractable on the considered graph class, one may ask whether fixed-parameter tractability could be extended to capture all FO-definable problems. We answer this question in the negative by showing that FO model checking on induced subgraphs of hypercubes is as difficult as FO model checking on general graphs.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0178-4617
1432-0541
DOI:10.1007/s00453-025-01354-4