Concepedia

The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues

B. Courcelle

RAIRO - Theoretical Informatics and Applications · 1992 · 184 citations · 18 references

DOIFull text

Open access

Concepts

Abstract

systmatique est constitutive d'une infraction pnale.

References

18

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

Bruno Courcelle · Information and Computation · 1990 · 1.5K citations

, , +10

Complexity of Finding Embeddings in a <i>k</i>-Tree

Stefan Arnborg, Derek G. Corneil, Andrzej Proskurowski · SIAM Journal on Algebraic and Discrete Methods · 1987 · 1.2K citations

, , +15

Easy problems for tree-decomposable graphs

Stefan Arnborg, Jens Lagergren, Detlef Seese · Journal of Algorithms · 1991 · 874 citations

, , +9

Graph minors. V. Excluding a planar graph

Neil Robertson, Paul Seymour · Journal of Combinatorial Theory Series B · 1986 · 756 citations

, , +8

Graph expressions and graph rewritings

Michel Bauderon, Bruno Courcelle · Theory of Computing Systems · 1987 · 238 citations

, , +11