Login / Signup

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.

Jana NovotnáKarolina OkrasaMichal PilipczukPawel RzazewskiErik Jan van LeeuwenBartosz Walczak
Published in: IPEC (2019)
Keyphrases
  • data structure
  • data sets
  • computationally efficient
  • data mining
  • computational complexity
  • significant improvement
  • worst case
  • optimization problems
  • orders of magnitude
  • times faster
  • recently developed