EFFICIENT BOUNDS FOR THE STABLE SET, VERTEX COVER AND SET PACKING PROBLEMS

被引:169
作者
HOCHBAUM, DS
机构
关键词
D O I
10.1016/0166-218X(83)90080-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:243 / 254
页数:12
相关论文
共 18 条
  • [1] [Anonymous], 1968, J COMBIN THEORY
  • [2] EVERY PLANAR MAP IS 4 COLORABLE .1. DISCHARGING
    APPEL, K
    HAKEN, W
    [J]. ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) : 429 - 490
  • [3] EVERY PLANAR MAP IS 4 COLORABLE .2. REDUCIBILITY
    APPEL, K
    HAKEN, W
    KOCH, J
    [J]. ILLINOIS JOURNAL OF MATHEMATICS, 1977, 21 (03) : 491 - 567
  • [4] BAASE S, 1978, COMPUTER ALGORITHMS
  • [5] On colouring the nodes of a network
    Brooks, RL
    [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1941, 37 : 194 - 197
  • [6] Chvatal V., 1979, Mathematics of Operations Research, V4, P233, DOI 10.1287/moor.4.3.233
  • [7] Erdos P., 1970, MAT LAPOK, V21, P249
  • [8] Galil Z., 1978, 19th Annual Symposium on Foundations of Computer Science, P231, DOI 10.1109/SFCS.1978.5
  • [9] Garey M. R., 1976, Theoretical Computer Science, V1, P237, DOI 10.1016/0304-3975(76)90059-1
  • [10] Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364