Monadic second-order evaluations on tree-decomposable graphs
From MaRDI portal
Publication:685464
DOI10.1016/0304-3975(93)90064-ZzbMath0789.68083MaRDI QIDQ685464
Publication date: 20 June 1994
Published in: Theoretical Computer Science (Search for Journal in Brave)
monadic second-order logic; linear algorithms; derivation tree; functions on graphs; hyperedge replacement graph-grammar; semiring homomorphisms
DB lookup for MSC labels failed
Related Items
A comparison of compatible, finite, and inductive graph properties, The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues