共 41 条
[1]
COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE
[J].
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS,
1987, 8 (02)
:277-284
[2]
Bellman R., 1957, DYNAMIC PROGRAMMING
[3]
Bertele Umberto, 1972, NONSERIAL DYNAMIC PR
[4]
COOPER GF, 1987, KSL8727 STANF U MED
[6]
DUBOIS D, 1990, 3RD P INT C INF PROC, P228
[8]
EZAWA KJ, 1986, THESIS STANFORD U ST
[9]
HOWARD R, 1984, PRINCIPLES APPL DECI, P719
[10]
HOWARD RA, 1990, INFLUENCE DIAGRAMS B, P3