THE EVEN-PATH PROBLEM FOR GRAPHS AND DIGRAPHS

被引：45

作者：

LAPAUGH, AS

PAPADIMITRIOU, CH

机构：

[1] BROWN UNIV,DEPT COMP SCI,PROVIDENCE,RI 02912

[2] NATL TECH UNIV ATHENS,GR-147 ATHENS,GREECE

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

来源：

NETWORKS | 1984年 / 14卷 / 04期

关键词：

D O I：

10.1002/net.3230140403

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：507 / 513

页数：7

共 12 条

[1]

Aho A. V., 1974, DESIGN ANAL COMPUTER, V1st

[2]

[Anonymous], 1977, COMMUNICATION

[3] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[4] THE DIRECTED SUBGRAPH HOMEOMORPHISM PROBLEM [J].

FORTUNE, S ;

HOPCROFT, J ;

WYLLIE, J .

THEORETICAL COMPUTER SCIENCE, 1980, 10 (02) :111-121

[5]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[6]

Karp R. M., 1972, COMPLEXITY COMPUTER

[7] THE SUBGRAPH HOMEOMORPHISM PROBLEM [J].

LAPAUGH, AS ;

RIVEST, RL .

JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (02) :133-149

[8]

LAWLER EL, 1977, COMBINATORIAL OPTIMI

[9]

Micali S., 1980, 21ST S F COMP SCI, P17

[10]

Papadimitriou C.H., 1981, COMBINATORIAL OPTIMI

← 1 2 →