5
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      Monadic second-order evaluations on tree-decomposable graphs

      ,
      Theoretical Computer Science
      Elsevier BV

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references15

          • Record: found
          • Abstract: not found
          • Article: not found

          The monadic second-order logic of graphs. I. Recognizable sets of finite graphs

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Complexity of Finding Embeddings in a k-Tree

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Easy problems for tree-decomposable graphs

                Bookmark

                Author and article information

                Journal
                Theoretical Computer Science
                Theoretical Computer Science
                Elsevier BV
                03043975
                March 1993
                March 1993
                : 109
                : 1-2
                : 49-82
                Article
                10.1016/0304-3975(93)90064-Z
                9a8a47a1-26f5-4417-b80e-54fe28f2676b
                © 1993

                http://www.elsevier.com/tdm/userlicense/1.0/

                History

                Comments

                Comment on this article