754 search results - page 1 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
COLOGNETWENTE
2008
13 years 7 months ago
2008
JGO
2011
13 years 14 days ago
2011
ICTCS
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We study efficient exact algorithms for several problems including Vertex Bipartization, Feedback Vertex Set, 3-Hitting Set, Max Cut in graphs with maximum degree at most...
LATIN
2010
Springer
14 years 10 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...
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...