Login / Signup

Decomposing a planar graph with girth at least 8 into a forest and a matching.

Yingqian WangQijun Zhang
Published in: Discret. Math. (2011)
Keyphrases
  • planar graphs
  • matching algorithm
  • image matching
  • feature points
  • optimal solution
  • probability distribution
  • least squares
  • parameter estimation
  • bayesian framework
  • weighted graph