Results 1  10
of
94,684
Random Graphs and the Parity Quantifier
, 2009
"... The classical zeroone law for firstorder logic on random graphs says that for every firstorder property ϕ in the theory of graphs and every p ∈ (0, 1), the probability that the random graph G(n, p) satisfies ϕ approaches either 0 or 1 as n approaches infinity. It is well known that this law fails ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
infinity, the probability that the random graph G(2n + i, p) satisfies ϕ approaches ai. Our results also extend appropriately to FO equipped with Modq quantifiers for prime q.
A quantitative comparison of graphbased models for internet topology
 IEEE/ACM TRANSACTIONS ON NETWORKING
, 1997
"... Graphs are commonly used to model the topological structure of internetworks, to study problems ranging from routing to resource reservation. A variety of graphs are found in the literature, including fixed topologies such as rings or stars, "wellknown" topologies such as the ARPAnet, and ..."
Abstract

Cited by 265 (3 self)
 Add to MetaCart
, and randomly generated topologies. While many researchers rely upon graphs for analytic and simulation studies, there has been little analysis of the implications of using a particular model, or how the graph generation method may a ect the results of such studies. Further, the selection of one generation
Efficient Testing of Large Graphs
 Combinatorica
"... Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case that it h ..."
Abstract

Cited by 176 (47 self)
 Add to MetaCart
Let P be a property of graphs. An test for P is a randomized algorithm which, given the ability to make queries whether a desired pair of vertices of an input graph G with n vertices are adjacent or not, distinguishes, with high probability, between the case of G satisfying P and the case
Degree Lower Bounds of TowerType for Approximating Formulas with Parity Quantifiers
, 2012
"... Kolaitis and Kopparty have shown that for any firstorder formula with parity quantifiers over the language of graphs there is a family of multivariate polynomials of constantdegree that agree with the formula on all but afraction of the graphs with vertices. The proof yields a bound on the degre ..."
Abstract
 Add to MetaCart
Kolaitis and Kopparty have shown that for any firstorder formula with parity quantifiers over the language of graphs there is a family of multivariate polynomials of constantdegree that agree with the formula on all but afraction of the graphs with vertices. The proof yields a bound
Parity Approach
, 2008
"... An electronic version of the paper may be downloaded • from the SSRN website: www.SSRN.com • from the RePEc website: www.RePEc.org • from the CESifo website: Twww.CESifogroup.org/wp T ..."
Abstract
 Add to MetaCart
An electronic version of the paper may be downloaded • from the SSRN website: www.SSRN.com • from the RePEc website: www.RePEc.org • from the CESifo website: Twww.CESifogroup.org/wp T
Quantifying
"... immunogold localization on electron microscopic thin sections: a compendium of new approaches for plant cell biologists ..."
Abstract
 Add to MetaCart
immunogold localization on electron microscopic thin sections: a compendium of new approaches for plant cell biologists
Fatal Attractors in Parity Games
"... Abstract. We study a new form of attractor in parity games and use it to define solvers that run in PTIME and are partial in that they do not solve all games completely. Technically, for color c this new attractor determines whether player c%2 can reach a set of nodes X of color c whilst avoiding an ..."
Abstract
 Add to MetaCart
Abstract. We study a new form of attractor in parity games and use it to define solvers that run in PTIME and are partial in that they do not solve all games completely. Technically, for color c this new attractor determines whether player c%2 can reach a set of nodes X of color c whilst avoiding
Results 1  10
of
94,684