Login / Signup

New Upper Bounds for the Number of Embeddings of Minimally Rigid Graphs.

Evangelos BartzosIoannis Z. EmirisRaimundas Vidunas
Published in: Discret. Comput. Geom. (2022)
Keyphrases
  • upper bound
  • computational complexity
  • lower bound
  • small number
  • worst case
  • three dimensional
  • sample size
  • graph matching
  • upper and lower bounds