754 search results - page 1 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
79
Voted
COLOGNETWENTE
2008
15 years 3 months ago
2008
JGO
2011
14 years 8 months ago
2011
107
click to vote
ICTCS
2005
Springer
15 years 7 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...
128
click to vote
LATIN
2010
Springer
15 years 8 months 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...
128
Voted
DAM
2000
15 years 1 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...