Two New Exact Methods for the Vertex Separation Problem
The Vertex Separation Problem (VSP) is an NP-hard combinatorial optimization problem in the context of graph theory. Particularly, VSP belongs to a family of linear ordering problems in which the goal is to find the best separator of vertices in a generic graph. In the literature reviewed, we only f...
Збережено в:
| Опубліковано в:: | International Journal of Combinatorial Optimization Problems and Informatics |
|---|---|
| Автори: | , , , , , |
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
International Journal of Combinatorial Optimization Problems and Informatics
2015
|
| Предмети: | |
| Онлайн доступ: | https://www.redalyc.org/articulo.oa?id=265239212004 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|