A Separator Theorem for Planar Graphs
暂无分享,去创建一个
[1] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .
[2] Richard Edwin Stearns,et al. Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.
[3] Frank Harary,et al. Graph Theory , 2016 .
[4] J. Hopcroft,et al. Efficient algorithms for graph manipulation , 1971 .
[5] Mike Paterson. Tape Bounds for Time-Bounded Turing Machines , 1972, J. Comput. Syst. Sci..
[6] A. George. Nested Dissection of a Regular Finite Element Mesh , 1973 .
[7] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[8] Robert E. Tarjan,et al. Efficient Planarity Testing , 1974, JACM.
[9] M. V. Wilkes,et al. The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .
[10] P. Erdoes,et al. On sparse graphs with dense long paths. , 1975 .
[11] M. Shamos. Problems in computational geometry , 1975 .
[12] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[13] Richard J. Lipton,et al. Multidimensional Searching Problems , 1976, SIAM J. Comput..
[14] Richard J. Lipton,et al. Space and Time Hierarchies for Classes of Control Structures and Data Structures , 1976, JACM.
[15] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[16] Richard J. Lipton,et al. Preserving average proximity in arrays , 1978, CACM.