Sciweavers

721 search results - page 14 / 145
» Almost universal graphs
Sort
View
89
Voted
AML
2010
98views more  AML 2010»
15 years 25 days ago
Small universal families for graphs omitting cliques without GCH
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...
Katherine Thompson
ICCS
1994
Springer
15 years 4 months ago
UDS: A Universal Data Structure
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, ...
Robert Levinson
117
Voted
CCCG
2009
15 years 1 months ago
Colored Simultaneous Geometric Embeddings and Universal Pointsets
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...
Alejandro Estrella-Balderrama, J. Joseph Fowler, S...
RSA
2011
89views more  RSA 2011»
14 years 7 months ago
Excluding induced subgraphs: Critical graphs
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...
József Balogh, Jane Butterfield
143
Voted
COMPGEOM
1992
ACM
15 years 4 months ago
On-Line Steiner Trees in the Euclidean Plane
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...
Noga Alon, Yossi Azar