Exact Algorithms for Dominating Induced Matching Based on Graph Partition.
Mingyu XiaoHiroshi NagamochiPublished in: CoRR (2014)
Keyphrases
- exact algorithms
- graph matching
- knapsack problem
- vehicle routing problem with time windows
- exact solution
- heuristic methods
- max sat
- approximation algorithms
- partitioning algorithm
- maximum cardinality
- combinatorial optimization
- benders decomposition
- combinatorial problems
- matching algorithm
- bipartite graph
- graph structure
- weighted graph
- maximum weight
- computational problems
- vertex set
- graph model
- graph partitioning
- combinatorial optimization problems
- evolutionary algorithm
- constraint programming
- branch and bound algorithm
- greedy algorithm
- np complete
- linear programming
- simulated annealing