Login / Signup

H-join decomposable graphs and algorithms with runtime single exponential in rankwidth.

Binh-Minh Bui-XuanJan Arne TelleMartin Vatshelle
Published in: Discret. Appl. Math. (2010)
Keyphrases
  • graph theory
  • learning algorithm
  • computational cost
  • computationally efficient
  • theoretical analysis
  • significant improvement
  • optimization problems
  • max cut