754 search results - page 4 / 151 » Exact Algorithms for the Vertex Separator Problem in Graphs |
ALGORITHMICA
2008
13 years 7 months ago
2008
STOC
2006
ACM
14 years 7 months ago
2006
ACM
Let G be an n-vertex graph that has a vertex separator of size k that partitions the graph into connected components of size smaller
DM
2008
13 years 7 months ago
2008
We introduce a new graph for all whose cartesian powers the vertex isoperimetric problem has nested solutions. This is the fourth kind of graphs with this property besides the wel...
IPL
2007
13 years 7 months ago
2007
The disk dimension of a planar graph G is the least number k for which G embeds in the plane minus k open disks, with every vertex on the boundary of some disk. Useful properties ...
IWPEC
2009
Springer
14 years 1 months ago
2009
Springer
We describe a framework for expressing the complexity of algorithms for FPT problems with two separate parameters k, m and with exponential time bounds O∗ (xk ym ) where x, y &g...