ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space.
Fedor V. FominPetr A. GolovachTanmay InamdarSaket SaurabhPublished in: CoRR (2021)
Keyphrases
- graph theory
- data mining techniques
- theoretical analysis
- computationally efficient
- graph theoretical
- worst case
- orders of magnitude
- times faster
- polynomial time complexity
- data sets
- representational power
- computational geometry
- graph theoretic
- significant improvement
- computational complexity
- data structure
- learning algorithm
- neural network