Login / Signup
An $O^*(1.0821^n)$-Time Algorithm for Computing Maximum Independent Set in Graphs with Bounded Degree 3.
Davis Issac
Ragesh Jaiswal
Published in:
CoRR (2013)
Keyphrases
</>
learning algorithm
computational complexity
cost function
objective function
search space
simulated annealing
maximum independent set
genetic algorithm
special case
graph theory
graph structure
spanning tree
minimum spanning tree