共 24 条
- [1] COMPLEXITY OF FINDING EMBEDDINGS IN A K-TREE [J]. SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1987, 8 (02): : 277 - 284
- [2] BODLAENDER H, 1996, UNPUB TREEWIDTH MINI
- [3] Bodlaender H. L., 1993, Acta Cybernetica, V11, P1
- [5] Corneil D.G., 1994, LECT NOTES COMPUTER, V790, P211
- [6] Corneil DG, 1995, LECT NOTES COMPUT SC, V944, P292
- [7] Dirac G. A., 1961, Abh. Math. Semin. Univ. Hambg, V25, P71, DOI DOI 10.1007/BF02992776
- [8] Golumbic MC., 1980, Algorithmic Graph Theory and Perfect Graphs
- [9] TREE-WIDTH OF COCOMPARABILITY GRAPHS AND A NEW ORDER THEORETIC PARAMETER [J]. ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 1994, 11 (01): : 47 - 60
- [10] Kloks T., 1994, Treewidth. Computations and approximations, DOI 10.1007/BFb0045375