Center and diameter problems in plane triangulations and quadrangulations
暂无分享,去创建一个
[1] Alok Aggarwal,et al. Geometric Applications of a Matrix Searching Algorithm , 1986, Symposium on Computational Geometry.
[2] Norbert Peyerimhoff,et al. Curvature and Geometry of Tessellating Plane Graphs , 2001, Discret. Comput. Geom..
[3] Azriel Rosenfeld,et al. Centers of sets of pixels , 2000, Discret. Appl. Math..
[4] Alexandru T. Balaban,et al. Chemical Graphs: Looking Back and Glimpsing Ahead , 1995, J. Chem. Inf. Comput. Sci..
[5] Subhash Suri,et al. Computing Geodesic Furthest Neighbors in Simple Polygons , 1989, J. Comput. Syst. Sci..
[6] Hans-Jürgen Bandelt,et al. Decomposition andl1-Embedding of Weakly Median Graphs , 2000, Eur. J. Comb..
[7] Hans-Jürgen Bandelt,et al. Superextensions and the depth of median graphs , 1991, J. Comb. Theory, Ser. A.
[8] Victor Chepoi,et al. On Distances in Benzenoid Systems , 1996, J. Chem. Inf. Comput. Sci..
[9] R. C. Lyndon. A maximum principle for graphs , 1967 .
[10] Subhash Suri,et al. Matrix searching with the shortest path metric , 1993, SIAM J. Comput..