Tree-partite graphs and the complexity of algorithms
Author:
- 3 August 2005
- book chapter
- Published by Springer Nature
- p. 412-421
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Graph minors. III. Planar tree-widthJournal of Combinatorial Theory, Series B, 1984
- Graph minors. I. Excluding a forestJournal of Combinatorial Theory, Series B, 1983
- Languages which capture complexity classes1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982
- Some Graph Theoretical Operations and DecidabilityMathematische Nachrichten, 1979
- Decidability of second-order theories and automata on infinite trees.Transactions of the American Mathematical Society, 1969