-
1
-
-
0036437231
-
Testing subgraphs in large graphs
-
N. ALON, Testing subgraphs in large graphs, Random Structures Algorithms, 21 (2002), pp. 359-370.
-
(2002)
Random Structures Algorithms
, vol.21
, pp. 359-370
-
-
ALON, N.1
-
2
-
-
0003114972
-
The algorithmic aspects of the regularity lemma
-
N. ALON, R. A. DUKE, H. LEFMANN, V. RÖDL, AND R. YUSTER, The algorithmic aspects of the regularity lemma, J. Algorithms, 16 (1994), pp. 80-109.
-
(1994)
J. Algorithms
, vol.16
, pp. 80-109
-
-
ALON, N.1
DUKE, R.A.2
LEFMANN, H.3
RÖDL, V.4
YUSTER, R.5
-
3
-
-
0034360832
-
Efficient testing of large graphs
-
N. ALON, E. FISCHER, M. KRIVELEVICH, AND M. SZEGEDY, Efficient testing of large graphs, Combinatorica, 20 (2000), pp. 451-476.
-
(2000)
Combinatorica
, vol.20
, pp. 451-476
-
-
ALON, N.1
FISCHER, E.2
KRIVELEVICH, M.3
SZEGEDY, M.4
-
4
-
-
0035704542
-
Regular languages are testable with a constant number of queries
-
N. ALON, M. KRIVELEVICH, I. NEWMAN, AND M. SZEGEDY, Regular languages are testable with a constant number of queries, SIAM J. Comput., 30 (2001), pp. 1842-1862.
-
(2001)
SIAM J. Comput
, vol.30
, pp. 1842-1862
-
-
ALON, N.1
KRIVELEVICH, M.2
NEWMAN, I.3
SZEGEDY, M.4
-
5
-
-
0036487485
-
-
N. ALON AND M. KRIVELEVICH, Testing κ-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
-
N. ALON AND M. KRIVELEVICH, Testing κ-colorability, SIAM J. Discrete Math., 15 (2002), pp. 211-227.
-
-
-
-
6
-
-
0038310709
-
-
N. ALON AND A. SHAPIRA, Testing satisfiability, J. Algorithms, 47 (2003), pp. 87-103.
-
N. ALON AND A. SHAPIRA, Testing satisfiability, J. Algorithms, 47 (2003), pp. 87-103.
-
-
-
-
7
-
-
85128124252
-
-
N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System. Sci., 69 (2004), pp. 353-382.
-
N. ALON AND A. SHAPIRA, Testing subgraphs in directed graphs, J. Comput. System. Sci., 69 (2004), pp. 353-382.
-
-
-
-
8
-
-
55249097873
-
-
N. ALON AND A. SHAPIRA, A Separation Theorem in Property-Testing, manuscript.
-
N. ALON AND A. SHAPIRA, A Separation Theorem in Property-Testing, manuscript.
-
-
-
-
9
-
-
33748583768
-
-
N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2005, pp. 429-438.
-
N. ALON AND A. SHAPIRA, A characterization of the (natural) graph properties testable with one-sided error, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2005, pp. 429-438.
-
-
-
-
10
-
-
33644791095
-
Additive approximation for edge-deletion problems
-
IEEE Computer Society, Los Alamitos, CA
-
N. ALON, A. SHAPIRA, AND B. SUDAKOV, Additive approximation for edge-deletion problems, in Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2005, pp. 419-428.
-
(2005)
Proceedings of the IEEE Symposium on Foundations of Computer Science
, pp. 419-428
-
-
ALON, N.1
SHAPIRA, A.2
SUDAKOV, B.3
-
11
-
-
55249098623
-
-
N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
-
N. ALON AND J. H. SPENCER, The Probabilistic Method, 2nd ed., Wiley, New York, 2000.
-
-
-
-
12
-
-
35348953547
-
Every monotone 3-graph property is testable
-
C. AVART, V. RÖDL, AND M. SCHACHT, Every monotone 3-graph property is testable, SIAM J. Discrete Math., 21 (2007), pp. 73-92.
-
(2007)
SIAM J. Discrete Math
, vol.21
, pp. 73-92
-
-
AVART, C.1
RÖDL, V.2
SCHACHT, M.3
-
13
-
-
84867957342
-
Measures on monotone properties of graphs
-
J. BALOGH, B. BOLLOBÁS, AND D. WEINREICH, Measures on monotone properties of graphs, Discrete Appl. Math., 116 (2002), pp. 17-36.
-
(2002)
Discrete Appl. Math
, vol.116
, pp. 17-36
-
-
BALOGH, J.1
BOLLOBÁS, B.2
WEINREICH, D.3
-
14
-
-
0038957460
-
Edge-coloring cliques with many colors on subcliques
-
D. EICHHORN AND D. MUBAYI, Edge-coloring cliques with many colors on subcliques, Combinatorica, 20 (2000), pp. 441-444.
-
(2000)
Combinatorica
, vol.20
, pp. 441-444
-
-
EICHHORN, D.1
MUBAYI, D.2
-
15
-
-
85202231324
-
-
P. ERDO{double acute}S, P. FRANKL, AND V. RÖDL, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin., 2 (1986), pp. 113-121.
-
P. ERDO{double acute}S, P. FRANKL, AND V. RÖDL, The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent, Graphs Combin., 2 (1986), pp. 113-121.
-
-
-
-
16
-
-
0013334029
-
-
P. ERDO{double acute}S AND A. GYÁRFÁS, A variant of the classical Ramsey problem, Combinatorica, 17 (1997), pp. 459-467.
-
P. ERDO{double acute}S AND A. GYÁRFÁS, A variant of the classical Ramsey problem, Combinatorica, 17 (1997), pp. 459-467.
-
-
-
-
17
-
-
64049101170
-
Testing graphs for colorability properties
-
ACM, New York, SIAM, Philadelphia
-
E. FISCHER, Testing graphs for colorability properties, in Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, ACM, New York, SIAM, Philadelphia, 2001, pp. 873-882.
-
(2001)
Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms
, pp. 873-882
-
-
FISCHER, E.1
-
20
-
-
2542634184
-
Functions that, have read-twice constant width branching programs are not necessarily testable
-
E. FISCHER, I. NEWMAN, AND J. SGALL, Functions that, have read-twice constant width branching programs are not necessarily testable, Random Structures Algorithms, 24 (2004), pp. 175-193.
-
(2004)
Random Structures Algorithms
, vol.24
, pp. 175-193
-
-
FISCHER, E.1
NEWMAN, I.2
SGALL, J.3
-
21
-
-
13744252028
-
Every monotone graph property has a sharp threshold
-
E. FRIEDGUT AND G. KALAI, Every monotone graph property has a sharp threshold, Proc. Amer. Math. Soc., 124 (1996), pp. 2993-3002.
-
(1996)
Proc. Amer. Math. Soc
, vol.124
, pp. 2993-3002
-
-
FRIEDGUT, E.1
KALAI, G.2
-
22
-
-
0032108275
-
Property testing and its connection to learning and approximation
-
O. GOLDREICH, S. GOLDWASSER, AND D. RON, Property testing and its connection to learning and approximation, J. ACM, 45 (1998), pp. 653-750.
-
(1998)
J. ACM
, vol.45
, pp. 653-750
-
-
GOLDREICH, O.1
GOLDWASSER, S.2
RON, D.3
-
23
-
-
0042806309
-
Three theorems regarding testing graph properties
-
O. GOLDREICH AND L. TREVISAN, Three theorems regarding testing graph properties. Random Structures Algorithms, 23 (2003), pp. 23-57.
-
(2003)
Random Structures Algorithms
, vol.23
, pp. 23-57
-
-
GOLDREICH, O.1
TREVISAN, L.2
-
24
-
-
0003792618
-
-
2nd ed, Wiley, New York
-
R. L. GRAHAM, B. L. ROTHSCHILD, AND J. H. SPENCER, Ramsey Theory, 2nd ed., Wiley, New York, 1990.
-
(1990)
Ramsey Theory
-
-
GRAHAM, R.L.1
ROTHSCHILD, B.L.2
SPENCER, J.H.3
-
25
-
-
0032028848
-
Approximate graph coloring by semidefinite programming
-
D. KARGER, R. MOTWANI, AND M. SUDAN, Approximate graph coloring by semidefinite programming, J. ACM, 45 (1998), pp. 246-265.
-
(1998)
J. ACM
, vol.45
, pp. 246-265
-
-
KARGER, D.1
MOTWANI, R.2
SUDAN, M.3
-
26
-
-
55249120193
-
-
J. KOMLÓS AND M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdo{double acute}s Is Eighty, II, D. Miklós, V. T. Sós, and T. Szo{double acute}nyi, eds., János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
-
J. KOMLÓS AND M. SIMONOVITS, Szemerédi's regularity lemma and its applications in graph theory, in Combinatorics, Paul Erdo{double acute}s Is Eighty, Vol. II, D. Miklós, V. T. Sós, and T. Szo{double acute}nyi, eds., János Bolyai Math. Soc., Budapest, 1996, pp. 295-352.
-
-
-
-
27
-
-
0018292109
-
On the Shannon capacity of a graph
-
L. LOVÁSZ, On the Shannon capacity of a graph, IEEE Trans. Inform. Theory, 25 (1979), pp. 1-7.
-
(1979)
IEEE Trans. Inform. Theory
, vol.25
, pp. 1-7
-
-
LOVÁSZ, L.1
-
29
-
-
0034512364
-
Testing of functions that have small width branching programs
-
IEEE Computer Society, Los Alamitos, CA
-
I. NEWMAN, Testing of functions that have small width branching programs, in Proceedings of the 41st IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 2000, pp. 251-258.
-
(2000)
Proceedings of the 41st IEEE Symposium on Foundations of Computer Science
, pp. 251-258
-
-
NEWMAN, I.1
-
30
-
-
51249176551
-
-
V. RÖDL AND R. DUKE, On graphs with small subgraphs of large chromatic number, Graphs Combin., 1 (1985), pp. 91-96.
-
V. RÖDL AND R. DUKE, On graphs with small subgraphs of large chromatic number, Graphs Combin., 1 (1985), pp. 91-96.
-
-
-
-
31
-
-
0013370155
-
Property testing
-
P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds, Kluwer Academic Publishers, Dordrecht, The Netherlands
-
D. RON, Property testing, in Handbook of Randomized Computing, Vol. II, P. M. Pardalos, S. Rajasekaran, J. Reif, and J. D. P. Rolim, eds., Kluwer Academic Publishers, Dordrecht, The Netherlands, 2001, pp. 597-649.
-
(2001)
Handbook of Randomized Computing
, vol.2
, pp. 597-649
-
-
RON, D.1
-
33
-
-
0030128622
-
Robust characterizations of polynomials with applications to program testing
-
R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
-
(1996)
SIAM J. Comput
, vol.25
, pp. 252-271
-
-
RUBINFELD, R.1
SUDAN, M.2
-
34
-
-
0002572651
-
Regular partitions of graphs
-
J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds, CNRS, Paris
-
E. SZEMERÉDI, Regular partitions of graphs, in Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS 260, J. C. Bermond, J. C. Fournier, M. Las Vergnas, and D. Sotteau, eds., CNRS, Paris, 1978, pp. 399-401.
-
(1978)
Problèmes combinatoires et théorie des graphes, Colloq. Internat. CNRS
, vol.260
, pp. 399-401
-
-
SZEMERÉDI, E.1
|