851 search results - page 1 / 171 » An exact algorithm for solving the vertex separator problem |
JGO
2011
13 years 7 days ago
2011
COLOGNETWENTE
2008
13 years 6 months ago
2008
DAM
2000
13 years 5 months ago
2000
Feedback problems consist of removing a minimal number of vertices of a directed or undirected graph in order to make it acyclic. The problem is known to be NPcomplete. In this pa...
COR
2006
13 years 5 months ago
2006
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
LATIN
2010
Springer
14 years 3 days ago
2010
Springer
Many divide-and-conquer algorithms employ the fact that the vertex set of a graph of bounded treewidth can be separated in two roughly balanced subsets by removing a small subset o...