Fan Chung Graham

According to our database1, Fan Chung Graham authored at least 200 papers between 1973 and 2018.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Sum sequences modulo n.
J. Comb. Theory, Ser. A, 2018

Computing heat kernel pagerank and a local clustering algorithm.
Eur. J. Comb., 2018

The maximum relaxation time of a random walk.
Adv. Appl. Math., 2018

2017
The drop polynomial of a weighted digraph.
J. Comb. Theory, Ser. B, 2017

The Spectral Gap of Graphs Arising From Substring Reversals.
Electr. J. Comb., 2017

2016
Decomposition of Random Graphs into Complete Bipartite Graphs.
SIAM J. Discret. Math., 2016

Worst-case analysis of the LPT algorithm for single processor scheduling with time restrictions.
OR Spectr., 2016

A Generalized Alon-Boppana Bound and Weak Ramanujan Graphs.
Electr. J. Comb., 2016

Extreme values of the stationary distribution of random walks on directed graphs.
Adv. Appl. Math., 2016

2015
Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank.
Internet Math., 2015

A Local Clustering Algorithm for Connection Graphs.
Internet Math., 2015

Finding Consensus in Multi-Agent Networks Using Heat Kernel Pagerank.
CoRR, 2015

Edge flipping in the complete graph.
Adv. Appl. Math., 2015

Distributed Algorithms for Finding Local Clusters Using Heat Kernel Pagerank.
Proceedings of the Algorithms and Models for the Web Graph - 12th International Workshop, 2015

2014
A Brief Survey of PageRank Algorithms.
IEEE Trans. Netw. Sci. Eng., 2014

Single-processor scheduling with time restrictions.
J. Sched., 2014

Hypergraph Coloring Games and Voter Models.
Internet Math., 2014

Multicommodity Allocation for Dynamic Demands Using PageRank Vectors.
Internet Math., 2014

Ranking and Sparsifying a Connection Graph.
Internet Math., 2014

Discrepancy inequalities for directed graphs.
Discret. Appl. Math., 2014

A note on an alternating upper bound for random walks on semigroups.
Discret. Appl. Math., 2014

From quasirandom graphs to graph limits and graphlets.
Adv. Appl. Math., 2014

2013
Inversion-descent polynomials for restricted permutations.
J. Comb. Theory, Ser. A, 2013

Dirichlet PageRank and Ranking Algorithms Based on Trust and Distrust.
Internet Math., 2013

Solving Linear Systems with Boundary Conditions Using Heat Kernel Pagerank.
Proceedings of the Algorithms and Models for the Web Graph - 10th International Workshop, 2013

Integer Sets Containing No Solution to x + y = 3z.
Proceedings of the Mathematics of Paul Erdős I, 2013

2012
Braess's paradox in expanders.
Random Struct. Algorithms, 2012

Quasi-random hypergraphs revisited.
Random Struct. Algorithms, 2012

Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model.
Proceedings of the COLT 2012, 2012

Diameter of random spanning trees in a given graph.
Journal of Graph Theory, 2012

Finding and Visualizing Graph Clusters Using PageRank Optimization.
Internet Math., 2012

Edge flipping in graphs.
Adv. Appl. Math., 2012

Ranking and Sparsifying a Connection Graph.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

Multi-commodity Allocation for Dynamic Demands Using PageRank Vectors.
Proceedings of the Algorithms and Models for the Web Graph - 9th International Workshop, 2012

2011
On the Spectra of General Random Graphs.
Electr. J. Comb., 2011

Dirichlet PageRank and Trust-Based Ranking Algorithms.
Proceedings of the Algorithms and Models for the Web Graph - 8th International Workshop, 2011

Computer Networks.
Proceedings of the Computer Science, The Hardware, Software and Heart of It, 2011

2010
Descent polynomials for permutations with bounded drop size.
Eur. J. Comb., 2010

Tiling Polygons with Lattice Triangles.
Discret. Comput. Geom., 2010

Introduction to the Special Section on Internet and Network Economics.
Algorithmica, 2010

Braess's Paradox in Large Sparse Graphs.
Proceedings of the Internet and Network Economics - 6th International Workshop, 2010

A Sharp PageRank Algorithm with Applications to Edge Ranking and Graph Sparsification.
Proceedings of the Algorithms and Models for the Web-Graph - 7th International Workshop, 2010

2009
Random Graphs, A Whirlwind Tour of.
Proceedings of the Encyclopedia of Complexity and Systems Science, 2009

Packing equal squares into a large square.
J. Comb. Theory, Ser. A, 2009

Distributing Antidote Using PageRank Vectors.
Internet Math., 2009

Percolation in General Graphs.
Internet Math., 2009

A Local Graph Partitioning Algorithm Using Heat Kernel Pagerank.
Internet Math., 2009

Open Letter to the Internet Mathematics Community.
Internet Math., 2009

The Giant Component in a Random Subgraph of a Given Graph.
Proceedings of the Algorithms and Models for the Web-Graph, 6th International Workshop, 2009

2008
Primitive Juggling Sequences.
Am. Math. Mon., 2008

Erratum: Quasi-random graphs with given degree sequences.
Random Struct. Algorithms, 2008

Quasi-random graphs with given degree sequences.
Random Struct. Algorithms, 2008

Local Partitioning for Directed Graphs Using PageRank.
Internet Math., 2008

Four Graph Partitioning Algorithms.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A Network Coloring Game.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

3-D floorplanning using labeled tree and dual sequences.
Proceedings of the 2008 International Symposium on Physical Design, 2008

2007
The Spectral Gap of a Random Subgraph of a Graph.
Internet Math., 2007

Using PageRank to Locally Partition a Graph.
Internet Math., 2007

The workshop on internet topology (wit) report.
Computer Communication Review, 2007

Oblivious and Adaptive Strategies for the Majority and Plurality Problems.
Algorithmica, 2007

Drawing Power Law Graphs Using a Local/Global Decomposition.
Algorithmica, 2007

No-Three-in-Line-in-3D.
Algorithmica, 2007

Detecting Sharp Drops in PageRank and a Simplified Local Partitioning Algorithm.
Proceedings of the Theory and Applications of Models of Computation, 2007

2006
The Volume of the Giant Component of a Random Graph with Given Expected Degrees.
SIAM J. Discret. Math., 2006

Parallelism versus Memory Allocation in Pipelined Router Forwarding Engines.
Theory Comput. Syst., 2006

A brief overview of network algorithms.
J. Comput. Syst. Sci., 2006

Foreword.
J. Comput. Syst. Sci., 2006

Maximizing data locality in distributed systems.
J. Comput. Syst. Sci., 2006

Survey: Concentration Inequalities and Martingale Inequalities: A Survey.
Internet Math., 2006

The Diameter and Laplacian Eigenvalues of Directed Graphs.
Electr. J. Comb., 2006

Local Graph Partitioning using PageRank Vectors.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Modeling the Small-World Phenomenon with Local Network Flow.
Internet Math., 2005

2004
De Bruijn cycles for covering codes.
Random Struct. Algorithms, 2004

Spectral Grouping Using the Nyström Method.
IEEE Trans. Pattern Anal. Mach. Intell., 2004

Analyzing the Small World Phenomenon Using a Hybrid Model with Local Network Flow (Extended Abstract).
Proceedings of the Algorithms and Models for the Web-Graph: Third International Workshop, 2004

Parallelism versus memory allocation in pipelined router forwarding engines.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks.
Proceedings of the Proceedings IEEE INFOCOM 2004, 2004

Drawing Power Law Graphs.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
Duplication Models for Biological Networks.
J. Comput. Biol., 2003

The Spectra of Random Graphs with Given Expected Degrees.
Internet Math., 2003

Coupling Online and Offline Analyses for Random Power Law Graphs.
Internet Math., 2003

The Average Distance in a Random Graph with Given Expected Degrees.
Internet Math., 2003

Guessing Secrets with Inner Product Questions.
Internet Math., 2003

Finding Favorites
Electronic Colloquium on Computational Complexity (ECCC), 2003

2002
A chip-firing game and Dirichlet eigenvalues.
Discret. Math., 2002

Sparse Quasi-Random Graphs.
Combinatorica, 2002

Spectral Partitioning with Indefinite Kernels Using the Nyström Extension.
Proceedings of the Computer Vision, 2002

2001
Augmented Ring Networks.
IEEE Trans. Parallel Distrib. Syst., 2001

Dynamic location problems with limited look-ahead .
Theor. Comput. Sci., 2001

Editor's Foreword.
J. Comput. Syst. Sci., 2001

Distance Realization Problems with Applications to Internet Tomography.
J. Comput. Syst. Sci., 2001

A Random Graph Model for Power Law Graphs.
Experimental Mathematics, 2001

Guessing Secrets.
Electr. J. Comb., 2001

The Diameter of Sparse Random Graphs.
Adv. Appl. Math., 2001

Combinatorics for the East Model.
Adv. Appl. Math., 2001

Random Evolution in Massive Graphs.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

2000
A Harnack inequality for Dirichlet eigenvalues.
Journal of Graph Theory, 2000

Discrete Green's Functions.
J. Comb. Theory, Ser. A, 2000

Guest Editor's Foreword.
J. Comput. Syst. Sci., 2000

A random graph model for massive graphs.
Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, 2000

1999
An Upper Bound for the Turán Number t3(n,4).
J. Comb. Theory, Ser. A, 1999

Multidiameters and Multiplicities.
Eur. J. Comb., 1999

Coverings, Heat Kernels and Spanning Trees.
Electr. J. Comb., 1999

1998
Forced Convex n -Gons in the Plane.
Discret. Comput. Geom., 1998

Isoperimetric Inequalities for Cartesian Products of Graphs.
Comb. Probab. Comput., 1998

Combinatorial Problems Arising in Massive Data Sets (Abstract).
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
An Optimal Strategies for Cycle-Stealing in Networks of Workstations.
IEEE Trans. Computers, 1997

Stratified random walks on the n-cube.
Random Struct. Algorithms, 1997

Open problems of Paul Erdös in graph theory.
Journal of Graph Theory, 1997

A Tribute to Herbert S.Wilf.
Electr. J. Comb., 1997

Random walks on generating sets for finite groups.
Electr. J. Comb., 1997

Eigenvalues, Flows and Separators of Graphs.
Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997

1996
On sampling with Markov chains.
Random Struct. Algorithms, 1996

Scheduling Tree-Dags Using FIFO Queues: A Control-Memory Trade-Off.
J. Parallel Distributed Comput., 1996

A Combinatorial Laplacian with Vertex Weights.
J. Comb. Theory, Ser. A, 1996

Optimal Emulations by Butterfly-Like Networks.
J. ACM, 1996

Maximum subsets of (0, 1] with no solutions to x+y = kz.
Electr. J. Comb., 1996

Discrete Isoperimetric Inequalities.
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996

1995
Salvage-Embeddings of Complete Trees.
SIAM J. Discret. Math., 1995

On the Cover Polynomial of a Digraph.
J. Comb. Theory, Ser. B, 1995

Eigenvalues of Graphs and Sobolev Inequalities.
Comb. Probab. Comput., 1995

1994
Even Cycles in Directed Graphs.
SIAM J. Discret. Math., 1994

An Upper Bound on the Diameter of a Graph from Eigenvalues Associated with its Laplacian.
SIAM J. Discret. Math., 1994

Routing Permutations on Graphs Via Matchings.
SIAM J. Discret. Math., 1994

Reliable software and communication. I. An overview.
IEEE J. Sel. Areas Commun., 1994

Chordal Completions of Planar Graphs.
J. Comb. Theory, Ser. B, 1994

A near optimal algorithm for edge separators (preliminary version).
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Scheduling Trees using FIFO Queues: A Control-Memory Tradeoff.
Proceedings of the 6th Annual ACM Symposium on Parallel Algorithms and Architectures, 1994

1993
Communication Complexity and Quasi Randomness.
SIAM J. Discret. Math., 1993

A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t).
J. Comb. Theory, Ser. B, 1993

On hypergraphs having evenly distributed subhypergraphs.
Discret. Math., 1993

1992
Correction to 'Optical orthogonal codes: Design, analysis, and applications' (May 89 595-604).
IEEE Trans. Inf. Theory, 1992

Efficient Embeddings of Trees in Hypercubes.
SIAM J. Comput., 1992

Laplacian and vibrational spectra for homogeneous graphs.
Journal of Graph Theory, 1992

Subgraphs of a hypercube containing no small even cycles.
Journal of Graph Theory, 1992

Quasi-Random Subsets of Integern.
J. Comb. Theory, Ser. A, 1992

Universal cycles for combinatorial structures.
Discret. Math., 1992

The Number of Different Distances Determined by a Set of Points in the Euclidean Plane.
Discret. Comput. Geom., 1992

Graphs with Small Diameter After Edge Deletion.
Discret. Appl. Math., 1992

The Laplacian of a Hypergraph.
Proceedings of the Expanding Graphs, 1992

Tolerating Faults in Synchronization Networks.
Proceedings of the Parallel Processing: CONPAR 92, 1992

1991
Regularity Lemmas for Hypergraphs and Quasi-randomness.
Random Struct. Algorithms, 1991

Quasi-random tournaments.
Journal of Graph Theory, 1991

Partitioning Circuits for Improved Testability.
Algorithmica, 1991

Chordal Completions of Grids and Planar Graphs.
Proceedings of the Planar Graphs, 1991

1990
Quasi-Random Hypergraphs.
Random Struct. Algorithms, 1990

Quasi-Random Classes of Hypergraphs.
Random Struct. Algorithms, 1990

Universal graphs and induced-universal graphs.
Journal of Graph Theory, 1990

The maximum number of edges in 2K2-free graphs of bounded degree.
Discret. Math., 1990

1989
Optical orthogonal codes: Design, analysis, and applications.
IEEE Trans. Inf. Theory, 1989

Pebbling in Hypercubes.
SIAM J. Discret. Math., 1989

Universal Graphs for Bounded-Degree Trees and Planar Graphs.
SIAM J. Discret. Math., 1989

Graphs with small bandwidth and cutwidth.
Discret. Math., 1989

Sphere-and-Point Incidence Relations in High Dimensions with Applications to Unit Distances and Furthest-Neighbor Pairs.
Discret. Comput. Geom., 1989

Quasi-random graphs.
Combinatorica, 1989

A dynamic location problem for graphs.
Combinatorica, 1989

1988
On the Fractional Covering Number of Hypergraphs.
SIAM J. Discret. Math., 1988

The Diameter of a Cycle Plus a Random Matching.
SIAM J. Discret. Math., 1988

Pursuit - Evasion games on graphs.
Journal of Graph Theory, 1988

The average distance and the independence number.
Journal of Graph Theory, 1988

On induced subgraphs of the cube.
J. Comb. Theory, Ser. A, 1988

Self-organizing Sequential Search and Hilbert's Inequalities.
J. Comput. Syst. Sci., 1988

Explicit construction of linear sized tolerant networks.
Discret. Math., 1988

Optimal Simulations by Butterfly Networks (Preliminary Version)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
The forwarding index of communication networks.
IEEE Trans. Inf. Theory, 1987

On unavoidable hypergraphs.
Journal of Graph Theory, 1987

Highly irregular graphs.
Journal of Graph Theory, 1987

The maximum number of edges in a 3-graph not containing a given star.
Graphs Comb., 1987

1986
Minced Trees, with Applications to Fault-Tolerant VLSI Processor Arrays.
Math. Syst. Theory, 1986

Some intersection theorems for ordered sets and graphs.
J. Comb. Theory, Ser. A, 1986

Monotone subsequences in (0, 1)-matrices.
Graphs Comb., 1986

Optimal Simulations of Tree Machines (Preliminary Version)
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

1985
Strongly connected orientations of mixed multigraphs.
Networks, 1985

Extremal subgraphs for two graphs.
J. Comb. Theory, Ser. B, 1985

Quantitative Forms of a Theorem of Hilbert.
J. Comb. Theory, Ser. A, 1985

On the addressing problem for directed graphs.
Graphs Comb., 1985

1984
Diameter bounds for altered graphs.
Journal of Graph Theory, 1984

The Number of Different Distances Determined by n Points in the Plane.
J. Comb. Theory, Ser. A, 1984

Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs.
Discret. Math., 1984

1983
A survey of bounds for classical Ramsey numbers.
Journal of Graph Theory, 1983

On a Ramsey-type problem.
Journal of Graph Theory, 1983

Unavoidable Stars in 3-Graphs.
J. Comb. Theory, Ser. A, 1983

Edge-colored complete graphs with precisely colored subgraphs.
Combinatorica, 1983

On unavoidable graphs.
Combinatorica, 1983

1982
Minimal Decompositions of Hypergraphs into Mutually Isomorphic Subhypergraphs.
J. Comb. Theory, Ser. A, 1982

1981
A note on constructive methods for ramsey numbers.
Journal of Graph Theory, 1981

Universal caterpillars.
J. Comb. Theory, Ser. B, 1981

Minimal decompositions of graphs into mutually isomorphic subgraphs.
Combinatorica, 1981

1980
The Connection Patterns of Two Complete Binary Trees.
SIAM J. Matrix Anal. Appl., 1980

On Unimodality for Linear Extensions of Partial Orders.
SIAM J. Matrix Anal. Appl., 1980

On Unimodal Subsequences.
J. Comb. Theory, Ser. A, 1980

On the coverings of graphs.
Discret. Math., 1980

1979
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter.
Networks, 1979

1978
The Number of Baxter Permutations.
J. Comb. Theory, Ser. A, 1978

On graphs which contain all small trees.
J. Comb. Theory, Ser. B, 1978

On partitions of graphs into trees.
Discret. Math., 1978

1977
A problem on blocking probabilities in connecting networks.
Networks, 1977

Some results on hook lengths.
Discret. Math., 1977

1975
Optimal rearrangeable graphs.
Bell Syst. Tech. J., 1975

1973
On the ramsey numbers N(3, 3, ...3;2).
Discret. Math., 1973


  Loading...