MAXIMUM INTERNALLY STABLE SETS OF A GRAPH

被引：4

作者：

HAKIMI, SL

FRANK, H

机构：

[1] Department of Electrical Engineering and Computer Sciences, Electronics Research Laboratory, University of California, Berkeley

来源：

关键词：

D O I：

10.1016/0022-247X(69)90233-9

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

[No abstract available]

引用

页码：296 / &

共 12 条

[1]

Berge C., 1965, PROGRAMMING GAMES TR

[2]

Berge C., 1962, THEORY GRAPHS

[3]

EDMONDS J, 1962, ANN MATH SOC B, V68, P494

[4]

EDMONDS J, 1965, CAN MATH J, P449

[5] OPTIMAL MATCHINGS + DEGREE-CONSTRAINED SUBGRAPHS [J].

GOLDMAN, AJ .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1964, B 68 (01) :27-+

[6]

MAGHOUT K, 1959, CR HEBD ACAD SCI, V248, P2522

[7]

MATTHYS G, 1960, 2 P INT C OP RES AIX, P164

[8]

MATTHYS G, 1961, COMPTES RENDUS ACAD, V250, P2840

[9]

Norman R. Z., 1959, P AM MATH SOC, V10, P315

[10]

ORE O, 1962, AM MATH SOC COLLOQ P