Monadic second-order evaluations on tree-decomposable graphs
- 1 March 1993
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 109 (1-2) , 49-82
- https://doi.org/10.1016/0304-3975(93)90064-z
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph familiesAlgorithmica, 1992
- Monadic second-order definable graph transductionsPublished by Springer Nature ,1992
- The monadic second-order logic of graphs V: on closing the gap between definability and recognizabilityTheoretical Computer Science, 1991
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesJournal of Algorithms, 1990
- The monadic second-order logic of graphs. I. Recognizable sets of finite graphsInformation and Computation, 1990
- Graph expressions and graph rewritingsTheory of Computing Systems, 1987
- Linear-time computation of optimal subgraphs of decomposable graphsJournal of Algorithms, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Characterization and Recognition of Partial 3-TreesSIAM Journal on Algebraic Discrete Methods, 1986