Vance Faber - Citegraph

Author Info

Name	Affiliation	Papers
VANCE FABER	33740 NE 84th Pl.,Carnation, WA 98014 USA	21
Collaborators	Citations	PageRank
42	679	55.50
Referers	Referees	References
1457	177	91

Search Limit

1001000

Publications (21 rows)

Collaborators (42 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
Properties of Worst-Case GMRES.	0	0.34	2013
Global communication algorithms for Cayley graphs	0	0.34	2013
Global sum on symmetric networks	0	0.34	2012
Livelock free routing schemes	0	0.34	2012
Review of chromatic graph theory by Gary Chartrand and Ping Zhang	0	0.34	2011
Multi-scale correlation structure of gene expression in the brain.	6	0.59	2011
On Chebyshev Polynomials of Matrices	1	0.36	2010
The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case	28	2.39	2004
Unflippable Tetrahedral Complexes	1	0.35	2004
Statistical Analysis of Algorithms: A Case Study of Market-Clearing Mechanisms in the Power Industry	2	0.46	2003
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry	3	0.58	2001
Centroidal Voronoi Tessellations: Applications and Algorithms.	570	40.33	1999
Low-Bandwidth Routing and Electrical Power Networks	3	0.63	1998
The diameter and average distance of supertoroidal networks	1	0.37	1995
A computational attack on the conjectures of Graffiti: new counterexamples and proofs	5	0.55	1995
Restricted routing and wide diameter of the cycle prefix network	3	0.56	1994
Small Diameter Symmetric Networks From Linear Groups	12	1.40	1992
Algebraic Constructions of Efficient Broadcast Networks	33	3.48	1991
Graph Theory Plus Group Theory Equals Answers to Communication Problems-Invited Talk	0	0.34	1987
Comments on the paper “parallel efficiency can be greater than unity”	10	1.06	1987
Separation of graphs into three components by the removal of edges.	1	0.35	1980