ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.

Fedor V. Fomin Petr A. Golovach Tanmay Inamdar Saket Saurabh

Published in: FSTTCS (2021)

Keyphrases

graph theory
learning algorithm
computational complexity
worst case
upper bound
feature selection
data structure
lower bound
significant improvement
computational cost
computationally efficient
generalization error bounds
data mining techniques
graph theoretical