暂无分享,去创建一个
[1] David Peleg,et al. Distributed Computing: A Locality-Sensitive Approach , 1987 .
[2] Nicolas Bonichon,et al. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces , 2010, WG.
[3] Giri Narasimhan,et al. Approximating Geometric Bottleneck Shortest Paths , 2003, STACS.
[4] El Molla,et al. Yao spanners for wireless ad hoc networks , 2009 .
[5] Xiang-Yang Li,et al. Sparse power efficient topology for wireless networks , 2002, Proceedings of the 35th Annual Hawaii International Conference on System Sciences.
[6] Giri Narasimhan,et al. Geometric spanner networks , 2007 .
[7] Michiel H. M. Smid,et al. Pi/2-Angle Yao Graphs are Spanners , 2010, ISAAC.
[8] Paul Chew,et al. There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..
[9] Xiang-Yang Li,et al. Power efficient and sparse spanner for wireless ad hoc networks , 2001, Proceedings Tenth International Conference on Computer Communications and Networks (Cat. No.01EX495).
[10] Xiang-Yang Li,et al. Localized Algorithms for Energy Efficient Topology in Wireless Ad Hoc Networks , 2004, MobiHoc '04.
[11] Ovidiu Daescu,et al. Combinatorial optimization and applications : 4th International Conference, COCOA 2010, Kailua-Kona, HI, USA, December 18-20, 2010 : proceedings , 2010 .
[12] Mirela Damian,et al. Yao Graphs Span Theta Graphs , 2012, Discret. Math. Algorithms Appl..
[13] Ljubomir Perkovic,et al. Plane Spanners of Maximum Degree Six , 2010, ICALP.