COVERING POINTS OF A DIGRAPH WITH POINT-DISJOINT PATHS AND ITS APPLICATION TO CODE OPTIMIZATION

被引：56

作者：

BOESCH, FT ^{[1
]}

GIMPEL, JF ^{[1
]}

机构：

[1] BELL TEL LABS INC,HOLMDEL,NJ 07733

来源：

关键词：

D O I：

10.1145/322003.322005

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：192 / 198

页数：7

共 14 条

[1]

Allen F.E., 1970, ACM SIGPLAN NOTICES, V5, P1, DOI DOI 10.1145/390013.808479

[2]

BOESCH FT, 1974, 1973 P CAP C GRAPH T, P201

[3]

BUSACKER RG, 1965, FINITE GRAPHS NETWOR, P33

[4]

CHVATAL V, 1972, J COMBINATORIAL TH B, V15, P163

[5]

GOODMAN S, 1974, 1973 P CAP C GRAPH T, P262

[6]

Harary F., 1969, GRAPH THEORY, DOI DOI 10.21236/AD0705364

[7]

Hecht M. S., 1972, SIAM Journal on Computing, V1, P188, DOI 10.1137/0201014

[8] CHARACTERIZATIONS OF REDUCIBLE FLOW GRAPHS [J].

HECHT, MS ;

ULLMAN, JD .

[9]

HOLTZ P, 1972, CARIES RES, V6, P103

[10]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P225, DOI 10.1137/0202019