Login / Signup

Algorithms for graphs of bounded treewidth via orthogonal range searching.

Sergio CabelloChristian Knauer
Published in: Comput. Geom. (2009)
Keyphrases
  • bounded treewidth
  • highly parallelizable
  • graph theory
  • computational complexity
  • learning algorithm
  • information retrieval
  • optimal solution
  • special case
  • range queries
  • related problems