1101 search results - page 16 / 221 » An Algorithm for the Graph Crossing Number Problem |
158
click to vote
ADHOCNOW
2004
Springer
15 years 11 months ago
2004
Springer
Topology control is the problem of assigning transmission power values to the nodes of an ad hoc network so that the induced graph satisfies some specified property. The most fun...
161
Voted
GD
2000
Springer
15 years 10 months ago
2000
Springer
The merit of automatic graph layout algorithms is typically judged on their computational efficiency and the extent to which they conform to aesthetic criteria (for example, minimi...
161
Voted
JDA
2010
15 years 1 months ago
2010
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
149
Voted
IWOCA
2009
Springer
16 years 27 days ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
189
Voted
CIE
2007
Springer
16 years 16 days ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....