Abstract
We establish that the finite set of obstructions of a minor-closed set of graphs given by a hyperedge replacement grammar can be effectively constructed. Our proof uses an auxiliary result stating that the system of equations associated with a proper hyperedge replacement grammar has a unique solution.
Cite
CITATION STYLE
APA
Courcelle, B., & Sénizergues, G. (1996). The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1073, pp. 351–367). Springer Verlag. https://doi.org/10.1007/3-540-61228-9_98
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free