Login / Signup

ETH-Tight Algorithms for Finding Surfaces in Simplicial Complexes of Bounded Treewidth.

Mitchell BlackNello BlaserAmir NayyeriErlend Raa Vågset
Published in: SoCG (2022)
Keyphrases
  • worst case
  • highly parallelizable
  • bounded treewidth
  • lower bound
  • database
  • objective function
  • domain knowledge
  • decision problems