Subexponential-time algorithms for finding large induced sparse subgraphs.
Jana NovotnáKarolina OkrasaMichal PilipczukPawel RzazewskiErik Jan van LeeuwenBartosz WalczakPublished in: CoRR (2019)
Keyphrases
- data structure
- computationally efficient
- recently developed
- orders of magnitude
- computational complexity
- significant improvement
- computational cost
- maximum clique
- computational efficiency
- worst case
- machine learning algorithms
- random variables
- constraint satisfaction problems
- times faster
- graph theory
- maximal cliques
- feature space