ON THE COMPLEXITY OF GENERAL GRAPH FACTOR PROBLEMS

被引：135
作者：
KIRKPATRICK, DG
HELL, P
机构：
[1] SIMON FRASER UNIV, DEPT COMP SCI, BURNABY V5A 1S6, BC, CANADA
[2] SIMON FRASER UNIV, DEPT MATH, BURNABY V5A 1S6, BC, CANADA
来源：
SIAM JOURNAL ON COMPUTING | 1983年 / 12卷 / 03期
关键词：
D O I：
10.1137/0212040
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
引用
收藏
页码：601 / 609
页数：9
相关论文
共 41 条
[1]  
Berge C., 1973, GRAPHS HYPERGRAPHS, V7
[2]   COVERING POINTS OF A DIGRAPH WITH POINT-DISJOINT PATHS AND ITS APPLICATION TO CODE OPTIMIZATION [J].
BOESCH, FT ;
GIMPEL, JF .
JOURNAL OF THE ACM, 1977, 24 (02) :192-198
[3]  
Christofides N., 2022, OPERATIONS RES FORUM, V3, DOI [10.1007/s43069-021-00101-z, DOI 10.1007/S43069-021-00101-Z]
[4]  
Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3
[5]  
COOK SA, 3RD P ACM S THEOR CO, P151
[6]  
CUNNINGHAM WH, 1978, MATH PROGRAM STUD, V8, P50, DOI 10.1007/BFb0121194
[7]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113
[8]   PATHS TREES AND FLOWERS [J].
EDMONDS, J .
CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&
[9]   MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].
EDMONDS, J .
JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+
[10]  
EDMONDS J, 1970, COMBINATORIAL STRUCT, P89
12345