Login / Signup

Finding the exact bound of the maximum degrees of class two graphs embeddable in a surface of characteristic epsilon in {-1, -2, -3}.

Rong LuoYue Zhao
Published in: J. Comb. Theory, Ser. B (2008)
Keyphrases
  • upper bound
  • graph matching
  • surface reconstruction
  • three dimensional
  • d objects
  • level set
  • range data
  • graph mining