Independent Sets near the Lower Bound in Bounded Degree Graphs.

Zdenek Dvorák Bernard Lidický

Published in: STACS (2017)

Keyphrases

lower bound
bounded degree
graph theoretic
upper bound
branch and bound algorithm
bounded treewidth
branch and bound
worst case
np hard
objective function
optimal solution
lower and upper bounds
directed graph
graph mining
natural language
polynomial approximation
sufficiently accurate
decision making