Rubber bands, convex embeddings and graph connectivity
暂无分享,去创建一个
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] Don Coppersmith,et al. On the Asymptotic Complexity of Matrix Multiplication , 1982, SIAM J. Comput..
[3] Shimon Even,et al. Graph Algorithms , 1979 .
[4] W. T. Tutte. How to Draw a Graph , 1963 .
[5] R. Connelly. Rigidity and energy , 1982 .
[6] Robert E. Tarjan,et al. Computing an st -Numbering , 1976, Theor. Comput. Sci..
[7] Garrett Birkhoff,et al. A survey of modern algebra , 1942 .
[8] A. Ingleton,et al. Gammoids and transversal matroids , 1973 .
[9] Stuart J. Berkowitz,et al. On Computing the Determinant in Small Parallel Time Using a Small Number of Processors , 1984, Inf. Process. Lett..
[10] G. Birkhoff,et al. A survey of modern algebra , 1942 .
[11] L. Lovász. Combinatorial problems and exercises , 1979 .
[12] Jacob T. Schwartz,et al. Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.
[13] Zvi Galil,et al. Finding the Vertex Connectivity of Graphs , 1980, SIAM J. Comput..
[14] Hazel Perfect,et al. SYMMETRIZED FORM OF P. HALL'S THEOREM ON DISTINCT REPRESENTATIVES , 1966 .