Exact algorithms for the vertex separator problem in graphs.
Cid C. de SouzaVictor F. CavalcantePublished in: Networks (2011)
Keyphrases
- exact algorithms
- undirected graph
- approximation algorithms
- knapsack problem
- directed graph
- attributed graphs
- exact solution
- labeled graphs
- benders decomposition
- vehicle routing problem with time windows
- heuristic methods
- hamiltonian cycle
- combinatorial optimization
- computational problems
- combinatorial optimization problems
- connected subgraphs
- max sat
- special case
- vertex set
- network design problem
- maximum cardinality
- graph mining
- edge weights
- graph matching
- combinatorial problems
- traveling salesman problem
- np hard
- tabu search
- worst case
- optimal solution