24 search results - page 1 / 5 » Treewidth Lower Bounds with Brambles |
ALGORITHMICA
2008
13 years 9 months ago
2008
MOC
2000
13 years 9 months ago
2000
Lower bounds for the condition numbers of the preconditioned systems are obtained for the Bramble-Pasciak-Schatz substructuring preconditioner and the Neumann-Neumann preconditione...
AAIM
2006
Springer
14 years 3 months ago
2006
Springer
ESA
2004
Springer
14 years 3 months ago
2004
Springer
Edge contraction is shown to be a useful mechanism to improve lower bound heuristics for treewidth. A successful lower bound for treewidth is the degeneracy: the maximum over all ...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...