Lower Bounds on the Number of Realizations of Rigid Graphs.

Georg Grasegger Christoph Koutschan Elias P. Tsigaridas

Published in: Exp. Math. (2020)

Keyphrases

lower bound
computational complexity
upper bound
neural network
bayesian networks
small number
graph theory
maximum number
running times