270 search results - page 1 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
101
click to vote
FUIN
2010
14 years 10 months ago
2010
We study 0-1 laws for extensions of first-order logic by Lindstr
76
Voted
JCT
2011
14 years 8 months ago
2011
139
Voted
ECCC
2007
15 years 1 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...
115
Voted
SIGECOM
2009
ACM
15 years 7 months 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...
99
Voted
DM
2006
15 years 1 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...