Graph-theoretic concepts in computer science. 17th International Workshop, WG '91, Fischbachau, Germany, June 17-19, 1991. Proceedings (Q1189493)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Bodlaender, Hans L.; Gilbert, John R.; Hafsteinsson, Hjálmtýr; Kloks, Ton}, Approximating treewidth, pathwidth, and minimum elimination tree height, 1-12 [Zbl 0768.68121] \textit{Courcelle, B.; Mosbah, M.}, Monadic second-order evaluations on tree-decomposable graphs, 13-24 [Zbl 0768.68130] \textit{Heckmann, R.; Klasing, R.; Monien, B.; Unger, W.}, Optimal embedding of complete binary trees into lines and grids, 25-35 [Zbl 0776.05038] \textit{Okada, Yasuyoshi; Hayashi, Masahiro}, Graph rewriting systems and their application to network reliability analysis, 36-47 [Zbl 0768.68072] \textit{Zündorf, Albert; Schürr, Andy}, Nondeterministic control structures for graph rewriting systems, 48-62 [Zbl 0768.68074] \textit{Andries, Marc; Paredaens, Jan}, A language for generic graph-transformations, 63-74 [Zbl 0768.68114] \textit{Freund, Rudolf; Haberstroh, Brigitte}, Attributed elementary programmed graph grammars, 75-84 [Zbl 0768.68080] \textit{Ihler, Edmund}, The complexity of approximating the class Steiner tree problem, 85-96 [Zbl 0768.68046] \textit{Lonc, Zbigniew}, On complexity of some chain and antichain partition problems, 97-104 [Zbl 0768.68052] \textit{Czyzowicz, J.; Rivera-Campo, E.; Santoro, N.; Urrutia, J.; Zaks, J.}, Tight bounds for the rectangular art gallery problem, 105-112 [Zbl 0783.68131] \textit{Guibas, Leonidas J.; Mitchell, Joseph S. B.; Roos, Thomas}, Voronoi diagrams of moving points in the plane, 113-125 [Zbl 0789.68141] \textit{Shoudai, Takayoshi; Miyano, Satoru}, Using maximal independent sets to solve problems in parallel, 126-134 [Zbl 0768.68029] \textit{Kedem, Zvi M.; Palem, Krishna V.; Pantziou, Grammati E.; Spirakis, Paul G.; Zaroliagis, Christos D.}, Fast parallel algorithms for coloring random graphs, 135-147 [Zbl 0768.68024] \textit{Jiang, X. Y.; Bunke, H.}, Optimal vertex ordering of a graph and its application to symmetry detection, 148-158 [Zbl 0768.68150] \textit{Sýkora, Ondrej; Vrťo, Imrich}, Edge separators for graphs of bounded genus with applications, 159-168 [Zbl 0773.05045] \textit{Du, Ding-Zhu; Lyuu, Yuh-Dauh; Hsu, D. Frank}, Line digraph iterations and the spread concept---with application to graph theory, fault tolerance, and routing, 169-179 [Zbl 0776.05046] \textit{Kučera, Luděk}, A generalized encryption scheme based on random graphs, 180-186 [Zbl 0768.68157] \textit{Feuerstein, Esteban; Marchetti-Spaccamela, Alberto}, Dynamic algorithms for shortest paths in planar graphs, 187-197 [Zbl 0768.68138] \textit{Stewart, Iain A.}, Complete problems for logspace involving lexicographic first paths in graphs, 198-208 [Zbl 0768.68182] \textit{Takaoka, Tadao}, A new upper bound on the complexity of the all pairs shortest path problem, 209-213 [Zbl 0768.68062] \textit{Sýkora, Ondrej; Vrťo, Imrich}, On the crossing number of the hyperbube and the cube connected cycles, 214-218 [Zbl 0772.05056] \textit{Damaschke, Peter}, Logic arrays for interval indicator functions, 219-225 [Zbl 0768.68133] \textit{Stöhr, Elena}, On the broadcast time of the butterfly network, 226-229 [Zbl 0788.94020] \textit{Bodlaender, Hans L.}, On disjoint cycles, 230-238 [Zbl 0815.05040] \textit{Brandstädt, Andreas}, Short disjoint cycles in cubic bridgeless graphs, 239-249 [Zbl 0776.05063]