Graph Rewriting: An Algebraic and Logic Approach
Author:
- Bruno CourcelleBCBruno Courcelle
- 1 January 1990
- book chapter
- Published by Elsevier
- p. 193-242
Abstract
No abstract availableThis publication has 51 references indexed in Scilit:
- Dynamic programming on graphs with bounded treewidth1988
- Problems easy for tree-decomposable graphs extended abstract1988
- Polynomial algorithms for graph isomorphism and chromatic index on partial k-treesLecture Notes in Computer Science, 1988
- 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
- Amalgamation of graph transformations: A synchronization mechanismJournal of Computer and System Sciences, 1987
- Fundamental properties of infinite treesTheoretical Computer Science, 1983
- Least fixed point of a functorJournal of Computer and System Sciences, 1979
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960