Fan Chung Graham
Claim Your Author Page
Ensure your research is discoverable on Semantic Scholar. Claiming your author page allows you to personalize the information displayed and manage publications (all current information on this profile has been aggregated automatically from publisher and metadata sources).
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… Continue Reading
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… Continue Reading
An optical orthogonal code (OOC) is a family of (0,1) sequences with good auto- and cross-correlation properties, i.e the autocorrelation of each sequence exhibits the `thumbtack' shape and the cross… Continue Reading
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… Continue Reading
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… Continue Reading
For every @e>0 and every integer m>0, we construct explicitly graphs with O(m/@e) vertices and maximum degree O(1/@e^2), such that after removing any (1-@e) portion of their vertices or edges, the… Continue Reading
Chrysanthemum Wain's Pink Lady is a new cultivar, distinguished by its overall pink color with a rose colored eye, an exceptionally upright to spreading branching habit and good flowering… Continue Reading
We propose a random graph model which is a special case of sparserandom graphs with given degree sequences which satisfy a power law. This model involves only a small number of paramo eters, called… Continue Reading
Abstract In this paper, we explore generalizations of de Bruijn cycles for a variety of families of combinatorial structures, including permutations, partitions and subsets of a finite set.
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… Continue Reading