Login / Signup

Polynomial fixed-parameter algorithms: A case study for longest path on interval graphs.

Archontia C. GiannopoulouGeorge B. MertziosRolf Niedermeier
Published in: Theor. Comput. Sci. (2017)
Keyphrases
  • graph theory
  • computational complexity
  • orders of magnitude
  • learning algorithm
  • data structure
  • benchmark datasets
  • times faster
  • max cut
  • data sets
  • neural network
  • machine learning
  • case study
  • significant improvement