132 search results - page 9 / 27 » A Simple Test for Interval Graphs |
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We derive a continuous probability distribution which generates neighbours of a point in an interval in a similar way to the bitwise mutation of a Gray code binary string...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
In this paper, we present a measure associated with detection and inference of statistically anomalous clusters of a graph based on the likelihood test of observed and expected ed...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
ICPP
2006
IEEE
15 years 4 months ago
2006
IEEE
stractions are extensively used to understand and solve challenging computational problems in various scientific and engineering domains. They have particularly gained prominence...
CP
2000
Springer
15 years 2 months ago
2000
Springer
plexity Theorems: Talk Abstract . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 David McAllester Regular Papers Automatic Generation of Propagation Rules for F...