Worst-case ration for planar graphs and the method of induction on faces
暂无分享,去创建一个
[1] K. Appel,et al. Every planar map is four colorable. Part I: Discharging , 1977 .
[2] Robert E. Tarjan,et al. Application of a Planar Separator Theorem , 1977, FOCS.
[3] Andrew Chi-Chih Yao,et al. New Algorithms for Bin Packing , 1978, JACM.
[4] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[5] Robert E. Tarjan,et al. Applications of a planar separator theorem , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[6] Robert E. Tarjan,et al. Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..
[7] Jeffrey D. Ullman,et al. Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms , 1974, SIAM J. Comput..
[8] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..
[9] D. Rose. A GRAPH-THEORETIC STUDY OF THE NUMERICAL SOLUTION OF SPARSE POSITIVE DEFINITE SYSTEMS OF LINEAR EQUATIONS , 1972 .
[10] Andrew Chi-Chih Yao,et al. Resource Constrained Scheduling as Generalized Bin Packing , 1976, J. Comb. Theory A.
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] David S. Johnson,et al. Approximation algorithms for combinatorial problems , 1973, STOC.