275 search results - page 27 / 55 » Parameterized Complexity of Generalized Vertex Cover Problem... |
161
click to vote
MFCS
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
147
click to vote
IPSN
2010
Springer
15 years 10 months ago
2010
Springer
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
144
click to vote
SIAMDM
2008
15 years 4 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
149
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
Process variations in modern VLSI technologies are growing in both magnitude and dimensionality. To assess performance variability, complex simulation and performance models param...
169
click to vote
COLT
1993
Springer
15 years 8 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...