Login / Signup
A lower bound on the size of universal sets for planar graphs.
Marek Chrobak
Howard J. Karloff
Published in:
SIGACT News (1989)
Keyphrases
</>
lower bound
planar graphs
upper bound
branch and bound algorithm
objective function
branch and bound
np hard
upper and lower bounds
optimal solution
probabilistic model
approximate inference
lower and upper bounds
partition function