270 search results - page 1 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
FUIN
2010
13 years 3 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
JCT
2011
13 years 21 days ago
2011
ECCC
2007
13 years 5 months ago
2007
We study graph properties which are testable for bounded degree graphs in time independent of the input size. Our goal is to distinguish between graphs having a predetermined grap...
SIGECOM
2009
ACM
14 years 8 days ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
DM
2006
13 years 5 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...