Characterization of graph classes by forbidden structures and reductions
We have shown in this paper, that forbidden structures and reductions describe different classes of graph languages. For important applications, the graph language under consideration can be defined by both concepts. It is an open problem, how to characterize such languages. It would be very useful to restrict systems of forbidden structures such that one can to construct an equivalent reduction system. In (3.2), a reduction system with NP-complete membership-problem is given. The membership -problem remains NP-complete even, if the transformations T and T1 are removed. It is an open question, whether there is a reduction system with one rule and NP-complete membership-problem. Furthermore, reduction systems should be restricted such that the membership-problem is solvable in polynomial time. Obviously, the required property should be decidable.
Unable to display preview. Download preview PDF.
- [BJ 66]C.Böhm, G.Jacopini: “Flow Diagrams, Turing Machines, and Languages With Only Two Formation Rules” Communications of the ACM, Vol. 9, pp. 366–371, 1966Google Scholar
- [GJ 79]M.R.Garey, D.S.Johnson: “Computers and Intractability — A Guide to the Theory of NP-Completeness” W.H.Freeman and Company, 1979Google Scholar
- [Gr 63]S.Greibach: “The Undecidability of the Ambiguity Problem for Minimal Linear Grammars” Information & Control, Vol. 6, No. 2, pp. 119–125, 1963Google Scholar
- [Ha 72]F.Harary: “Graph Theory” Addison-Wesley Publishing Company, 3rd printing, 1972Google Scholar
- [He 77]M.S.Hecht: “Flow Analysis of Computer Programs” North Holland, 1977Google Scholar
- [Ke 81]K.Kennedy: “A Survey of Data Flow Analysis Techniques” in S.S.Muchnik, N.D.Jones (Ed.): “Program Flow Analysis” Prentice Hall, 1981Google Scholar
- [Wa 82]F.Wankmüller: “Charakterisierung von Graphenklassen durch verbotene Strukturen und Reduktionen” Dissertation, Universität Dortmund, 1982Google Scholar