754 search results - page 12 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
125
click to vote
STOC
2010
ACM
15 years 8 months ago
2010
ACM
We consider the problem of maintaining a large matching and a small vertex cover in a dynamically changing graph. Each update to the graph is either an edge deletion or an edge in...
182
click to vote
DAM
2011
14 years 10 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
102
click to vote
STOC
2002
ACM
16 years 3 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
146
Voted
DAM
2006
15 years 3 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
121
Voted
COCOON
2007
Springer
15 years 9 months ago
2007
Springer
It is shown that the traveling salesman problem for graphs