Searching for "On Brambles" – sorted by Relevance.
-
Treewidth Lower Bounds with Brambles
- Treewidth Lower Bounds with Brambles Hans L. Bodlaender Alexander Grigoriev Arie M. C. A. Koster
- Add To MetaCart
-
On tree width, bramble size, and expansion
- On tree width, bramble size, and expansion Martin Grohe ∗ Dániel Marx † June 12, 2008 Abstract A
- Add To MetaCart
-
BraMBLe: A Bayesian Multiple-Blob Tracker
- BraMBLe: A Bayesian Multiple-Blob Tracker Abstract Blob trackers have become increasingly powerful
- Cited by 125 (1 self) – Add To MetaCart
-
James H. Bramble, Joseph E. Pasciak, And Olaf Steinbach
- ON THE STABILITY OF THE L 2 PROJECTION IN H 1(# JAMES H. BRAMBLE, JOSEPH E. PASCIAK, AND OLAF
- Add To MetaCart
-
Submodular partition functions
- introduced in [6], we propose a new proof of the duality between the bramble-number of a graph and its tree
- Add To MetaCart
-
Studies in Domain Decomposition: Multi-level Methods and the Biharmonic Dirichlet Problem
- by Dryja and Widlund on a multilevel additive Schwarz algorithm, and the theory given by Bramble, Pasciak
- Cited by 17 (0 self) – Add To MetaCart
-
Two short proofs concerning tree-decompositions
- that the tree-width of a finite graph is exactly one less than the largest order of its brambles. 1
- Cited by 3 (0 self) – Add To MetaCart
-
Hypertree-Width and Related Hypergraph Invariants
- invariants such as bramble-number, branchwidth, linkedness, and the minimum number of cops required to win
- Cited by 11 (7 self) – Add To MetaCart
-
Hypertree Width and Related Hypergraph Invariants
- invariants such as bramble number, branch width, linkedness, and the minimum number of cops required to win
- Cited by 1 (0 self) – Add To MetaCart
-
Analysis Of An Unstructured Finite Volume Method
- results interesting in the framework of the multigrid convergence theory of Bramble, Ewing, Pasciak
- Cited by 1 (1 self) – Add To MetaCart

