A refined algorithm for maximum independent set in degree-4 graphs.
Mingyu XiaoHiroshi NagamochiPublished in: J. Comb. Optim. (2017)
Keyphrases
- preprocessing
- detection algorithm
- optimization algorithm
- computational cost
- learning algorithm
- random graphs
- worst case
- search space
- computational complexity
- cost function
- np hard
- dynamic programming
- objective function
- knapsack problem
- evolutionary algorithm
- optimal solution
- ant colony optimization
- minimum spanning tree
- neural network
- adjacency graph
- graph isomorphism
- maximum common subgraph