暂无分享,去创建一个
[1] Lebrecht Henneberg,et al. Die graphische Statik der Starren Systeme , 1911 .
[2] Günter Rote,et al. Planar minimally rigid graphs and pseudo-triangulations , 2005, Comput. Geom..
[3] Ileana Streinu,et al. A combinatorial approach to planar non-colliding robot arm motion planning , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[4] Subhash Khot,et al. Vertex cover might be hard to approximate to within 2-/spl epsiv/ , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..
[5] Evans William,et al. Angle Covers: Algorithms and Complexity , 2020 .
[6] S. Safra,et al. On the hardness of approximating minimum vertex cover , 2005 .
[7] Raymond E. Miller,et al. Complexity of Computer Computations , 1972 .
[8] Rolf Niedermeier,et al. Invitation to Fixed-Parameter Algorithms , 2006 .
[9] Silvio Micali,et al. An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[10] Alon Itai,et al. On the Complexity of Timetable and Multicommodity Flow Problems , 1976, SIAM J. Comput..
[11] Viggo Kann,et al. Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..
[12] Paul C. Kainen,et al. Thickness and coarseness of graphs , 1973 .