SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Volumn 20, Issue 4, 2000, Pages 451-476

Efficient testing of large graphs

(4) Alon, Noga a,c Fischer, Eldar a,d Krivelevich, Michael a,b,c Szegedy, Mario c,e

a TEL AVIV UNIVERSITY (Israel)

b RUTGERS UNIVERSITY (United States)

c AT AND T LABS RESEARCH (United States)

d NEC LABORATORIES AMERICA (United States)

e INSTITUTE FOR ADVANCED STUDY (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034360832 PISSN: 02099683 EISSN: None Source Type: Journal
DOI: 10.1007/s004930070001 Document Type: Article

Times cited : (313)

References (15)

1
- 85032933992
- The algorithmic aspects of the regularity lemma
- rd IEEE FOCS (1992), 473-481. Also: Journal of Algorithms, 16 (1994), 80-109.
- (1992) rd IEEE FOCS , pp. 473-481
- Alon, N.¹ Duke, R.A.² Lefmann, H.³ Rödl, V.⁴ Yuster, R.⁵

2
- 85032933992
- rd IEEE FOCS (1992), 473-481. Also: Journal of Algorithms, 16 (1994), 80-109.
- (1994) Journal of Algorithms , vol.16 , pp. 80-109

3
- 0032614554
- Regular languages are testable with a constant number of queries
- th IEEE FOCS (1999), 645-655.
- (1999) th IEEE FOCS , pp. 645-655
- Alon, N.¹ Krivelevich, M.² Newman, I.³ Szegedy, M.⁴

4
- 0003430191
- Wiley
- N. ALON and J. SPENCER: The Probabilistic Method, Wiley (1992).
- (1992) The Probabilistic Method
- Alon, N.¹ Spencer, J.²

5
- 0001587222
- On sets of integers which contain no three terms in arithmetic progression
- F. A. DEHREND: On sets of integers which contain no three terms in arithmetic progression, Proc. National Academy of Sciences USA, 32 (1946), 331-332.
- (1946) Proc. National Academy of Sciences USA , vol.32 , pp. 331-332
- Dehrend, F.A.¹

6
- 0004200084
- Academic Press, New York
- B. DOLLOBÁS: Extremal Graph Theory, Academic Press, New York (1978).
- (1978) Extremal Graph Theory
- Dollobás, B.¹

7
- 77957056109
- Extremal graphs without large forbidden subgraphs
- B. BOLLOBÁS, P. ERDOS, M. SIMONOVITS and E. SZEMERÉDI: Extremal graphs without large forbidden subgraphs, Annals of Discrete Mathematics, 3 (1978), 29-41.
- (1978) Annals of Discrete Mathematics , vol.3 , pp. 29-41
- Bollobás, B.¹ Erdos, P.² Simonovits, M.³ Szemerédi, E.⁴

8
- 0030389356
- The regularity lemma and approximation schemes for dense problems
- th IEEE FOCS (1996), 12-20.
- (1996) th IEEE FOCS , pp. 12-20
- Frieze, A.M.¹ Kannan, R.²

9
- 0030409286
- Property testing and its connection to learning and approximation
- th IEEE FOCS (1996), 339-348. Also: Journal of the ACM, 45 (1998), 653-750.
- (1996) th IEEE FOCS , pp. 339-348
- Goldreich, O.¹ Goldwasser, S.² Ron, D.³

10
- 0032108275
- th IEEE FOCS (1996), 339-348. Also: Journal of the ACM, 45 (1998), 653-750.
- (1998) Journal of the ACM , vol.45 , pp. 653-750

11
- 0031285884
- Lower bounds of tower type for Szemerédi's uniformity lemma
- W. T. GOWERS: Lower bounds of tower type for Szemerédi's Uniformity Lemma, Geometric and Functional Analysis, 7 (1997), 322-337.
- (1997) Geometric and Functional Analysis , vol.7 , pp. 322-337
- Gowers, W.T.¹

12
- 0000501688
- Szemerédi's regularity lemma and its applications in graph theory
- D. Miklós, V. T. Sós, T. Szönyi eds., János Bolyai Math. Soc., Budapest
- J. KOMLÓS and M. SIMONOVITS: Szemerédi's Regularity Lemma and its applications in graph theory, In: Combinatorics, Paul Erdos is Eighty, Vol II (D. Miklós, V. T. Sós, T. Szönyi eds.), János Bolyai Math. Soc., Budapest (1996), 295-352.
- (1996) Combinatorics, Paul Erdos is Eighty , vol.2 , pp. 295-352
- Komlós, J.¹ Simonovits, M.²

13
- 51249176551
- On graphs with small subgraphs of large chromatic number
- V. RÖDL and R. DUKE: On graphs with small subgraphs of large chromatic number, Graphs and Combinatorics, 1 (1985), 91-96.
- (1985) Graphs and Combinatorics , vol.1 , pp. 91-96
- Rödl, V.¹ Duke, R.²

14
- 0030128622
- Robust characterization of polynomials with applications to program testing
- R. RUBINFELD and M. SUDAN: Robust characterization of polynomials with applications to program testing, SIAM Journal of Computing, 25 (1996), 252-271.
- (1996) SIAM Journal of Computing , vol.25 , pp. 252-271
- Rubinfeld, R.¹ Sudan, M.²

15
- 0002572651
- Regular partitions of graphs
- J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.
- E. SZEMERÉDI: Regular partitions of graphs, in: Proc. Colloque Inter. CNRS (J. C. Bermond, J. C. Fournier, M. Las Vergnas and D. Sotteau eds.), 1978, 399-401.
- (1978) Proc. Colloque Inter. CNRS , pp. 399-401
- Szemerédi, E.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.