#### Filter Results:

- Full text PDF available (117)

#### Publication Year

1973

2017

- This year (2)
- Last 5 years (17)
- Last 10 years (46)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Reid Andersen, Fan Chung Graham, Kevin J. Lang
- 2006 47th Annual IEEE Symposium on Foundations of…
- 2006

A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than the size of the input… (More)

- Charless C. Fowlkes, Serge J. Belongie, Fan Chung Graham, Jitendra Malik
- IEEE Transactions on Pattern Analysis and Machine…
- 2004

Spectral graph theoretic methods have recently shown great promise for the problem of image segmentation. However, due to the computational demands of these approaches, applications to large problems… (More)

- William Aiello, Fan Chung Graham, Linyuan Lu
- STOC
- 2000

We propose a random graph model which is a special case of sparse random graphs with given degree sequences. This model involves only a small number of parameters, called logsize and log-log growth… (More)

- Fan Chung Graham, Jawad A. Salehi, Victor K.-W. Wei
- IEEE Trans. Information Theory
- 1989

Optical Orthogonal codes; design analysis and applications – p. 1/33

- Fan Chung Graham, Ronald L. Graham, Richard M. Wilson
- Combinatorica
- 1988

We introduce a large equivalence class of graph properties, all of which are shared by so-called random graphs. Unlike random graphs, however, it is often relatively easy to verify that a particular… (More)

- Noga Alon, Fan Chung Graham
- Discrete Mathematics
- 1988

What is the minimum possible number of vertices and edges of a graph G, such that even after removing all but E portion of its vertices or edges, the remaining graph still contains a path of length… (More)

- William Aiello, Fan Chung Graham, Linyuan Lu
- Experimental Mathematics
- 2001

We propose a random graph model which is a special case of sparse random graphs with given degree sequences which satisfy a power law. This model involves only a small number of parameters, called… (More)

- Fan Chung Graham, Ronald L. Graham, Peter Frankl, James B. Shearer
- J. Comb. Theory, Ser. A
- 1986

Of particular interest are those B for which the maximum families consist of socalled “kernel systems,” i.e., the family of all supersets of some fixed set in B. For example, we show that the set of… (More)

- William Aiello, Fan Chung Graham, Linyuan Lu
- FOCS
- 2001

Many massive graphs (such as WWW graphs and Call graphs) share certain universal characteristics which can be described by socalled the “power law”. In this paper, we will first briefly survey the… (More)

In this paper, we examine a spectral clustering algorithm for similarity graphs drawn from a simple random graph model, where nodes are allowed to have varying degrees, and we provide theoretical… (More)