• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Approximate tree decompositions of planar graphs in linear time.

Frank KammerTorsten Tholey
Published in: Theor. Comput. Sci. (2016)
Keyphrases
  • planar graphs
  • tree decompositions
  • constraint satisfaction problems
  • tree decomposition
  • minimum weight
  • complexity bounds
  • worst case
  • approximate inference
  • graph cuts
  • weighted graph
  • binary variables