Spanners in graphs of bounded degree
暂无分享,去创建一个
Leizhen Cai | J. Mark Keil | J. Keil | L. Cai
[1] Paul Chew,et al. There is a planar graph almost as good as the complete graph , 1986, SCG '86.
[2] Eli Upfal,et al. A tradeoff between space and efficiency for routing tables , 1988, STOC '88.
[3] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1990, Discret. Comput. Geom..
[4] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[5] A. Dress,et al. Reconstructing the shape of a tree from observed dissimilarity data , 1986 .
[6] Manfred Eigen,et al. The origin of genetic information. , 1981, Scientific American.
[7] Baruch Awerbuch,et al. Complexity of network synchronization , 1985, JACM.
[8] Carl Gutwin,et al. Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..
[9] Pravin M. Vaidya,et al. A sparse graph almost as good as the complete graph on points inK dimensions , 1991, Discret. Comput. Geom..
[10] David P. Dobkin,et al. On sparse spanners of weighted graphs , 1993, Discret. Comput. Geom..
[11] Arnold L. Rosenberg,et al. Optimal simulations of tree machines , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[12] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[13] Arthur L. Liestman,et al. Additive graph spanners , 1993, Networks.
[14] David Peleg,et al. An Optimal Synchronizer for the Hypercube , 1989, SIAM J. Comput..