2283 search results - page 242 / 457 » Bounds of Graph Characteristics |
STOC
1996
ACM
14 years 15 days ago
1996
ACM
We significantly improve known time bounds for solving the minimum cut problem on undirected graphs. We use a "semiduality" between minimum cuts and maximum spanning tree...
LCC
1994
14 years 13 days ago
1994
We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned by restricted linear constraints. This result enables us to deduce the non-expressi...
COLT
2006
Springer
14 years 2 days ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
DAGSTUHL
2004
13 years 9 months ago
2004
A well-studied problem in fault diagnosis is to identify the set of all good processors in a given set {p1, p2, . . . , pn} of processors via asking some processors pi to test whet...
DAM
2007
13 years 8 months ago
2007
We prove that local complementation and vertex deletion, operations from which vertexminors are defined, can simulate edge contractions. As an application, we prove that the rank...