Sciweavers

446 search results - page 11 / 90
» A Combinatorial Theorem for Trees
Sort
View
DLT
2006
14 years 11 months ago
Bag Context Tree Grammars
Bag context is a device for regulated rewriting in tree and string grammars. It represents context that is not part of the developing tree or string, but evolves on its own during ...
Frank Drewes, Christine du Toit, Sigrid Ewert, Bri...
53
Voted
ECAI
2000
Springer
15 years 1 months ago
Tree-based Heuristics in Modal Theorem Proving
We use a strong form of the tree model property to boost the performance of resolution-based first-order theorem provers on the so-called relational translations of modal formulas...
Carlos Areces, Rosella Gennari, Juan Heguiabehere,...
ESA
2009
Springer
159views Algorithms» more  ESA 2009»
15 years 4 months ago
Contraction Bidimensionality: The Accurate Picture
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth. As a consequence of our combinatorial results we u...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
75
Voted
COMGEO
2010
ACM
14 years 9 months ago
Mixed volume techniques for embeddings of Laman graphs
We use Bernstein's Theorem [1] to obtain combinatorial bounds for the number of embeddings of Laman graph frameworks modulo rigid motions. For this, we study the mixed volume...
Reinhard Steffens, Thorsten Theobald
JCT
2006
83views more  JCT 2006»
14 years 9 months ago
The mathematics of Bruce Rothschild
A review is given of some of the mathematical research of Bruce Rothschild, emphasizing his results in combinatorial theory, especially that part known as Ramsey Theory. Special em...
Neil Hindman