Exact algorithms for dominating induced matching based on graph partition.
Mingyu XiaoHiroshi NagamochiPublished in: Discret. Appl. Math. (2015)
Keyphrases
- exact algorithms
- graph matching
- knapsack problem
- vehicle routing problem with time windows
- exact solution
- partitioning algorithm
- approximation algorithms
- maximum cardinality
- matching algorithm
- combinatorial optimization
- vertex set
- benders decomposition
- combinatorial optimization problems
- graph structure
- computational problems
- combinatorial problems
- max sat
- heuristic methods
- weighted graph
- maximum weight
- relational structures
- bipartite graph
- normalized cut
- neural network
- np hard
- special case