ON THE CUTWIDTH AND THE TOPOLOGICAL BANDWIDTH OF A TREE
暂无分享,去创建一个
[1] Fillia Makedon,et al. Topological Bandwidth , 1983, CAAP.
[2] 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).
[3] 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).
[4] Norman E. Gibbs,et al. The bandwidth problem for graphs and matrices - a survey , 1982, J. Graph Theory.
[5] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[6] David S. Johnson,et al. Stockmeyer: some simplified np-complete graph problems , 1976 .
[7] D. R. Lick,et al. The Theory and Applications of Graphs. , 1983 .
[8] David S. Johnson,et al. COMPLEXITY RESULTS FOR BANDWIDTH MINIMIZATION , 1978 .
[9] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..