Sciweavers

400 search results - page 9 / 80
» On some Properties of DNA Graphs
Sort
View
DM
2010
144views more  DM 2010»
13 years 8 months ago
Balanced Cayley graphs and balanced planar graphs
A balanced graph is a bipartite graph with no induced circuit of length 2 (mod 4). These graphs arise in linear programming. We focus on graph-algebraic properties of balanced gra...
Joy Morris, Pablo Spiga, Kerri Webb
TCS
2008
13 years 7 months ago
On the weight of universal insertion grammars
We study the computational power of pure insertion grammars. We show that pure insertion grammars of weight 3 can characterize all recursively enumerable languages. This is achiev...
Lila Kari, Petr Sosík
COCO
2007
Springer
89views Algorithms» more  COCO 2007»
14 years 2 months ago
Testing Properties of Constraint-Graphs
We study a model of graph related formulae that we call the Constraint-Graph model. A constraintgraph is a labeled multi-graph (a graph where loops and parallel edges are allowed)...
Shirley Halevy, Oded Lachish, Ilan Newman, Dekel T...
ICDT
2007
ACM
107views Database» more  ICDT 2007»
14 years 2 months ago
Some Algorithmic Improvements for the Containment Problem of Conjunctive Queries with Negation
Query containment is a fundamental problem of databases. Given two queries q1 and q2, it asks whether the set of answers to q1 is included in the set of answers to q2 for any datab...
Michel Leclère, Marie-Laure Mugnier
LATA
2010
Springer
14 years 5 months ago
Untestable Properties Expressible with Four First-Order Quantifiers
Abstract. In property testing, the goal is to distinguish between structures that have some desired property and those that are far from having the property, after examining only a...
Charles Jordan and Thomas Zeugmann