Login / Signup

Efficiently Partitioning the Edges of a 1-Planar Graph into a Planar Graph and a Forest.

Sam BarrTherese C. Biedl
Published in: ISAAC (2021)
Keyphrases
  • planar graphs
  • undirected graph
  • weighted graph
  • minimum weight
  • directed graph
  • approximate inference
  • partition function
  • upper bound
  • graphical models
  • edge detector
  • edge information