论文信息 - Tree-partite graphs and the complexity of algorithms - 字舞流文

Tree-partite graphs and the complexity of algorithms

Detlef Seese | D. Seese

[1] L. Beineke,et al. Selected Topics in Graph Theory 2 , 1985 .

[2] Paul D. Seymour,et al. Graph minors. III. Planar tree-width , 1984, J. Comb. Theory, Ser. B.

[3] Neil Immerman. Languages which capture complexity classes , 1983, STOC '83.

[4] Paul D. Seymour,et al. Graph minors. I. Excluding a forest , 1983, J. Comb. Theory, Ser. B.

[5] Nobuji Saito,et al. Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[6] D. Seese,et al. Some Graph Theoretical Operations and Decidability , 1979 .

[7] B. Bollobás,et al. Extremal Graph Theory , 2013 .

[8] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[9] H. Keisler,et al. Handbook of mathematical logic , 1977 .

[10] M. Rabin. Decidability of second-order theories and automata on infinite trees. , 1969 .