The complexity of searching a graph
暂无分享,去创建一个
Christos H. Papadimitriou | Nimrod Megiddo | David S. Johnson | Michael Randolph Garey | S. L. Hakimi | David S. Johnson | M. Garey | C. Papadimitriou | N. Megiddo | S. Hakimi
[1] Robert E. Tarjan,et al. Upper and lower bounds on time-space tradeoffs , 1979, STOC '79.
[2] Frank Harary,et al. Graph Theory , 2016 .
[3] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[4] Fillia Makedon,et al. Polynomial time algorithms for the MIN CUT problem on degree restricted trees , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[5] Mihalis Yannakakis,et al. A polynomial algorithm for the MIN CUT linear arrangement of trees , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[6] Journal of the Association for Computing Machinery , 1961, Nature.
[7] F. Makedon. Layout problems and their complexity , 1982 .
[8] T. D. Parsons,et al. Pursuit-evasion in a graph , 1978 .
[9] Robert E. Tarjan,et al. Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.
[10] Pamela Paulsen,et al. May , 1890, The Hospital.
[11] Robert E. Tarjan,et al. Depth-First Search and Linear Graph Algorithms , 1972, SIAM J. Comput..
[12] Fillia Makedon,et al. Topological Bandwidth , 1983, CAAP.
[13] Christos H. Papadimitriou,et al. The Complexity of Searching a Graph (Preliminary Version) , 1981, FOCS.