共 17 条
[1]
Aardal K., 1996, 96011 MAASTR U
[2]
Aardal K., 2001, Tech Report 01-40, ZIB
[3]
AARDAL KI, IN PRESS OPER RES
[4]
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[5]
COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE
[J].
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS,
1987, 8 (02)
:277-284
[6]
Bodlaender H. L., 1993, Acta Cybernetica, V11, P1
[8]
Eisenblatter A., 2000, FAP WEB WEBSITE DEVO
[9]
FEREMANS C, 2001, THESIS U LIBRE BRUXE
[10]
HURKENS CAJ, 1995, 9534 COSOR EINDH U T