Matthias Middendorf

Learn More
The computational complexity of a number of problems concerning induced structures in graphs is studied, and compared with the complexity of corresponding problems concerning non-induced structures. The effect on these problems of restricting the input to planar graphs is also considered. The principal results include: (1) Induced Maximum Matching and(More)
Middendorf, M. and F. Pfeiffer, Weakly transitive orientations, Hasse diagrams and string graphs, Discrete Mathematics 111 (1993) 393-400. We introduce the notion of a weakly transitive orientation for graphs as a natural generalization of transitive orientations and give a characterization for weakly transitive orientations in terms of forbidden(More)
  • 1