COVERING GRAPHS BY SIMPLE CIRCUITS

被引：38

作者：

ITAI, A

LIPTON, RJ

PAPADIMITRIOU, CH

RODEH, M

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

[2] IBM CORP,ISRAEL SCI CTR,TECHNION CITY,HAIFA 32000,ISRAEL

来源：

关键词：

D O I：

10.1137/0210058

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：746 / 750

页数：5

共 8 条

[1] MINIMUM PARTITION OF A MATROID INTO INDEPENDENT SUBSETS [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :67-+

[2]

Edmonds J., 1972, COMBINATORIAL ALGORI, P91

[3]

Hopcroft J. E., 1973, SIAM Journal on Computing, V2, P135, DOI 10.1137/0202012

[4]

ITAI A, 1978, P ICALP C UDINE

[5]

Matthews K. R., 1978, Journal of Graph Theory, V2, P143, DOI 10.1002/jgt.3190020207

[6] EDGE-DISJOINT BRANCHING IN DIRECTED MULTIGRAPHS [J].

SHILOACH, Y .

[7]

TARJAN R, 1975, INFORM PROCESS LETT, V3, P51

[8]

[No title captured]