This work has been supported by the “Programme de Recherches Coordonneés: Mathématiques et Informatique” and the ESPRIT Basic Research Action 3299 “Computing by Graph Transformations”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Arnborg, D.G. Corneil, and A. Proskurowski. Complexity of finding embeddings in a k-tree, SIAM J. Alg. Disc. Meth., 8(1987), 277–287.
S. Arnborg, B. Courcelle, A. Proskurowski and D. Seese. An algebraic theory of graph reduction, Report 90–02, Bordeaux-1 University (1990).
S. Arnborg, J. Lagergren, and D. Seese. Problems easy for tree decomposable graphs.(extended abstract), Proc. 15th ICALP. Springer Verlag, Lect. Notes in Comp. Sc. 317(1988) 38–51.
S. Arnborg, and A. Proskurowski. Characterization and recognition of partial 3-trees, SIAM J. Alg. Disc. Meth., 7(1986), 305–314.
M. Bauderon and B. Courcelle. Graph expressions and graph rewritings, Math. systems Theory 20(1987), 83–127.
H.L. Bodlaender. Complexity of path forming games, Report RUU-CS-89-29, Utrecht University (1989).
H.L. Bodlaender. Polynomial algorithms for chromatic index and graph isomorphism on partial k-trees, in Proc. 1st Scandinavian Workshop on Algorithmic Theory. Springer Verlag, Lect. Notes in Comp. Sc. 318(1988) 223–232.
J.A. Bern, E. Lawler and A. Wong. Linear time computation of optimal subgraphs of decomposable graphs, J. Algorithms 8(1987), 216–235.
B. Courcelle. The monadic second-order logic of graphs I: Recognizable sets of finite graphs, Information and Computation 85(1990), 12–75.
B. Courcelle. Graph rewriting: an algebraic and logic approach, in Handbook of Computer Science, Volume B, J. Van Leeuwen Ed., Elsevier (1990), 193–242.
B. Courcelle. The monadic second-order logic of graphs V: On closing the gap between definability and recognizibility, Theoret. Compt. Sci. 80(1991) 153–202.
B. Courcelle, M. Mosbah. Monadic second-order evaluations on treedecomposable graphs, Report 90–110, Bordeaux-1 University (1990).
P. Deransart, M. Jourdan, B. Lorho. Attribute grammars, Springer Verlag, Lect. Notes in Comp. Sc. 323(1988).
M.R. Garey and D.S. Johnson. Computers and Intractability, W.H. Freeman and Company, San Francisco (1979).
A. Habel. Hyperedge Replacement Grammars and Languages, PhD. thesis, Bremen University (1989).
A. Habel, H.J. Kreowski and W. Vogler. Decidable boundness problems for hyperedge replacement graph grammars, Springer Verlag, Lect. Notes in Comp. Sc. 351(1989) 275–289.
D.S. Johnson. The NP-completeness column: An ongoing guide (16th), J. algorithms 6(1985), 434–451.
S. Miyano. The lexicographically first maximal subgraph problems: P-completeness and NC algorithms, Math. systems Theory 22(1989) 47–73.
J. Valdes, E. Lawler and R. Tarjan. The recognition of series-parallel digraphs, SIAM J. Comput. 11(1982) 289–313.
K. Takamizawa, T. Nishizeki and N. Saito. Linear-time computability of combinatorial problems on series-parallel graphs, J. Assoc. Comput. Mach 29(1982) 623–641.
T. Wimer. Linear algorithms on k-terminal graphs, PhD. thesis, Clemson University(1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Courcelle, B., Mosbah, M. (1992). Monadic second-order evaluations on tree-decomposable graphs. In: Schmidt, G., Berghammer, R. (eds) Graph-Theoretic Concepts in Computer Science. WG 1991. Lecture Notes in Computer Science, vol 570. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55121-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-55121-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55121-8
Online ISBN: 978-3-540-46735-9
eBook Packages: Springer Book Archive