10997 search results - page 276 / 2200 » On the Structure of Complete Sets |
196
click to vote
JGT
2008
15 years 6 months ago
2008
: Given a set F of graphs, a graph G is F-free if G does not contain any member of F as an induced subgraph. We say that F is a degree-sequence-forcing set if, for each graph G in ...
148
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
The known methods for constructing complete sets of mutually orthogonal frequency squares all yield one of two parameter sets. We show that almost all these constructions can be d...
296
click to vote
ICDE
2003
IEEE
16 years 8 months ago
2003
IEEE
XML documents are typically queried with a combination of value search and structure search. While querying by values can leverage traditional database technologies, evaluating st...
220
click to vote
VLDB
2002
ACM
15 years 6 months ago
2002
ACM
In spite of the many decades of progress in database research, surprisingly scientists in the life sciences community still struggle with inefficient and awkward tools for queryin...
163
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown