SOME VARIATIONS OF LEES ALGORITHM

被引：31

作者：

HOEL, JH ^{[1
]}

机构：

[1] SPERRY RAND CORP, UNIVAC DIV, COMP AIDED DESIGN DEPT, ROSEVILLE, MN 55113 USA

来源：

关键词：

D O I：

10.1109/TC.1976.5009200

中图分类号：

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

学科分类号：

0812 ;

摘要：

引用

页码：19 / 24

页数：6

共 10 条

[1] A MODIFICATION OF LEES PATH CONNECTION ALGORITHM [J].

AKERS, SB .

IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS, 1967, EC16 (01) :97-+

[2]

AKERS SB, 1972, DESIGN AUTOMATION DI, V1, P283

[3]

Dijkstra E. W., 1959, NUMERISCHE MATH, V1, P269, DOI DOI 10.1007/BF01386390

[4]

HITCHNER LE, 1968, ORC6825 OP RES CTR R

[5]

KNUTH DE, 1968, ART COMPUTER PROGRAM, V1, P2

[6]

Lee CY, 1961, IRE T ELECTRON COMPU, VEC-10, P346, DOI DOI 10.1109/TEC.1961.5219222

[7]

MOORE EF, 1959, P INT S THEORY SWITC, V30, P285

[8] LEE PATH CONNECTION ALGORITHM [J].

RUBIN, F .

[9]

RUBIN F, 1972, THESIS SYRACUSE U

[10]

RUBIN F, TO BE PUBLISHED