共 23 条
[1]
Bodlaender H.L.(1998)A partial Theor. Comput. Sci. 209 1-45
[2]
Clautiaux F.(2004)-arboretum of graphs with bounded treewidth RAIRO Oper. Res. 38 13-26
[3]
Moukrim A.(1997)Heuristic and meta-heuristic methods for computing graph treewidth Theor. Comput. Sci. 172 233-254
[4]
Négre S.(2002)Fugitive-search games on graphs and related parameters ACM Comput. Surv. 34 313-356
[5]
Carlier J.(2008)A survey of graph layout problems SIAM J. Comput. 38 1058-1079
[6]
Dendris N.D.(1976)Exact algorithms for treewidth and minimum fill-in Theor. Comput. Sci. 1 237-267
[7]
Kirousis L.M.(1987)Some simplified NP-complete graph problems SIAM J. Comput. 16 486-502
[8]
Thilikos D.M.(1962)Expected computation time for Hamiltonian path problem J. Soc. Ind. Appl. Math. 10 196-210
[9]
Díaz J.(1992)A dynamic programming approach to sequencing problems Inf. Process. Lett. 42 345-350
[10]
Petit J.(undefined)The vertex separation number of a graph equals its path width undefined undefined undefined-undefined