A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number.
Kazuhiro KuritaKunihiro WasaTakeaki UnoHiroki ArimuraPublished in: Theor. Comput. Sci. (2021)
Keyphrases
- computational complexity
- dynamic programming
- space complexity
- running times
- worst case
- search space
- detection algorithm
- memory requirements
- simulated annealing
- np complete
- polynomial time complexity
- k means
- randomized algorithm
- random graphs
- optimal solution
- graph isomorphism
- minimum spanning tree
- times faster
- lower bound
- objective function
- graph theoretic
- weighted graph
- memory space
- graph theory
- np hard
- maximum weight
- maximal clique enumeration