721 search results - page 14 / 145 » Almost universal graphs |
127
click to vote
AML
2010
15 years 4 months ago
2010
When no single universal model for a set of structures exists at a given cardinal, then one may ask in which models of set theory does there exist a small family which embeds the r...
153
click to vote
ICCS
1994
Springer
15 years 8 months ago
1994
Springer
This paper gives a data structure (UDS) for supporting database retrieval, inference and machine learning that attempts to unify and extend previous work in relational databases, ...
144
click to vote
CCCG
2009
15 years 5 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...
130
click to vote
RSA
2011
14 years 11 months ago
2011
Determining the cardinality and describing the structure of H-free graphs is wellinvestigated for many graphs H. In the nineties, Prömel and Steger proved that for a graph H with...
176
click to vote
COMPGEOM
1992
ACM
15 years 8 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...