332 search results - page 11 / 67 » Parameterized Graph Separation Problems |
ESA
2001
Springer
14 years 27 days ago
2001
Springer
We consider graph drawings in which vertices are assigned to layers and edges are drawn as straight line-segments between vertices on adjacent layers. We prove that graphs admittin...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
We investigate the parameterized complexity of generalisations and variations of the dominating set problem on classes of graphs that are nowhere dense. In particular, we show that...
TAMC
2009
Springer
14 years 2 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
PODC
2006
ACM
14 years 2 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
DAM
2000
13 years 8 months ago
2000
An irredundant set of vertices V V in a graph G = (V; E) has the property that for every vertex u V ; N[V - {u}] is a proper subset of N[V ]. We investigate the parameterized co...