Graph languages defined by systems of forbidden structures: A survey
This paper deals with different ways of defining graph languages. These are the so-called forbidden structures. Some results on decision problems, their complexity, and set theoretic closure properties are scetched. A normal form, the minimal systems, are given. Finally the influence of the different kinds of forbidden structures on the descriptive power of the systems is shown.
Unable to display preview. Download preview PDF.
- [Bl 87]Blödel, Volker "Charakterisierung von Graphsprachen durch Systeme von verbotenen Strukturen" Masterthesis Johannes Gutenberg-Universität Mainz, 1987Google Scholar
- [Du 84]Duchet, Pierre "Schemes of Graphs" Graph Theory and Combinatorics, Cambridge, 1984, pp. 145–153Google Scholar
- [FaKeZu 76]Farrow, R.; Kennedy, K.; Zucconi, L.; "Graph Grammars and Global Program Data Flow Analysis" Proc. of the 17th Annual IEEE Symposium on Foundations of Computer Science, Houston, Texas, 1976, pp 42–56Google Scholar
- [Fe 82]
- [Ha 72]Harary, Frank "Graph Theory" Addison-Wesley, 1972 (3rd printing)Google Scholar
- [HeUl 72]
- [Wa 82]Wankmüller, Frank "Characterization of Graph Classes by Forbidden Structures" Lecture Notes in Computer Science 153, 1983, pp. 405–414Google Scholar
- [WaWi 83]Wankmüller, Frank; Wiese, Udo "On Decision Problems for Forbidden Structures" Proc. WG '83, Osnabrück, Trauner Verlag, 1983, pp. 370–380Google Scholar
- [ScWa 84]Schwill, Andreas; Wankmüller, Frank "On Graph Languages Defined by Forbidden Structures and Reductions" Proc. WG '84, Berlin, Trauner Verlag, 1984, pp. 335–353Google Scholar