Login / Signup

On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs.

Evangelos BartzosIoannis Z. EmirisJosef Schicho
Published in: Appl. Algebra Eng. Commun. Comput. (2020)
Keyphrases
  • small number
  • computational complexity
  • fixed number
  • upper bound
  • three dimensional
  • np hard
  • graph theory
  • graph theoretic