Login / Signup
A lower bound for the smallest uniquely hamiltonian planar graph with minimum degree three.
Benedikt Klocker
Herbert Fleischner
Günther R. Raidl
Published in:
Appl. Math. Comput. (2020)
Keyphrases
</>
lower bound
planar graphs
upper bound
branch and bound
np hard
branch and bound algorithm
objective function
optimal solution
worst case
lower and upper bounds
upper and lower bounds
probabilistic inference
minimum cost
partition function
dynamic programming
randomized algorithm