论文信息 - Graph Operations and Monadic Second-Order Logic: A Survey - 字舞流文

Graph Operations and Monadic Second-Order Logic: A Survey

We handle finite graphs in two ways, as relational structures on the one hand, and as algebraic objects, i.e., as elements of algebras, based on graph operations on the other.

Bruno Courcelle | B. Courcelle

[1] Bruno Courcelle. Clique-width of countable graphs: a compactness property , 2000, Electron. Notes Discret. Math..

[2] Udi Rotics,et al. Polynomial Time Recognition of Clique-Width \le \leq 3 Graphs (Extended Abstract) , 2000, Latin American Symposium on Theoretical Informatics.

[3] Bruno Courcelle. The monadic second-order logic of graphs XIII: Graph drawings with edge crossings , 2000, Theor. Comput. Sci..

[4] Bruno Courcelle,et al. Upper bounds to the clique width of graphs , 2000, Discret. Appl. Math..

[5] B. Reed,et al. Polynomial Time Recognition of Clique-Width ≤ 3 Graphs , 2000 .

[6] Bruno Courcelle,et al. Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width , 2000, Theory of Computing Systems.