Login / Signup
Independent sets near the lower bound in bounded degree graphs.
Zdenek Dvorák
Bernard Lidický
Published in:
CoRR (2016)
Keyphrases
</>
lower bound
bounded degree
graph theoretic
upper bound
bounded treewidth
lower and upper bounds
objective function
worst case
branch and bound
branch and bound algorithm
np complete
np hard
optimal solution
graph matching
logic programs
prior knowledge
polynomial approximation