Graph-theoretic concepts in computer science. 16th international workshop WG '90, Berlin, Germany, June 20-22, 1990, Proceedings (Q1188996)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Pantziou, Grammati E.; Spirakis, Paul G.; Zaroliagis, Christos D.}, Optimal parallel algorithms for sparse graphs, 1-17 [Zbl 0768.68167] \textit{Plehn, Jürgen; Voigt, Bernd}, Finding minimally weighted subgraphs, 18-29 [Zbl 0768.68170] \textit{Bodlaender, Hans L.}, On the complexity of some coloring games, 30-40 [Zbl 0770.90098] \textit{Huckenbeck, Ulrich; Ruland, Detlev}, A generalized best-first search method in graphs, 41-60 [Zbl 0768.68146] \textit{Ma, Tze-Heng; Spinrad, Jeremy P.}, Avoiding matrix multiplication, 61-71 [Zbl 0768.68162] \textit{Damaschke, Peter}, Induced subgraph isomorphism for cographs is NP-complete, 72-78 [Zbl 0768.68037] \textit{Stamm, Hermann}, On feedback problems in planar digraphs, 79-89 [Zbl 0768.68060] \textit{Aurenhammer, Franz; Hagauer, Johann}, Recognizing binary Hamming graphs in \(O(n^ 2\log n)\) time, 90-98 [Zbl 0768.68116] \textit{Liao, Kuo-Feng; Sarrafzadeh, Majid}, Vertex-disjoint trees and boundary single-layer routing, 99-108 [Zbl 0768.68050] \textit{Ihler, Edmund}, Bounds on the quality of approximate solutions to the group Steiner problem, 109-118 [Zbl 0768.68045] \textit{Arbib, Claudio}, Two polynomial problems in PLA folding, 119-129 [Zbl 0767.68052] \textit{Formann, Michael; Wagner, Frank}, The VLSI layout problem in various embedding models, 130-139 [Zbl 0768.68042] \textit{Makedon, Fillia; Tragoudas, Spyros}, Approximating the minimum net expansion: Near optimal solutions to circuit partitioning problems, 140-153 [Zbl 0768.68055] \textit{Madhavapeddy, Seshu; Sudborough, I. Hal}, Deterministic message routing in faulty hypercubes, 154-169 [Zbl 0767.68008] \textit{Choi, Hyeong-Ah; Esfahanian, Abdol-Hossein}, On complexity of a message-routing strategy for multicomputer systems, 170-181 [Zbl 0767.68053] \textit{Zienicke, Peter}, Embeddings of treelike graphs into 2-dimensional meshes, 182-192 [Zbl 0820.05019] \textit{Das, A.; Thulasiraman, K.}, Diagnosis of \(t/s\)-diagnosable systems, 193-205 [Zbl 0768.68038] \textit{Biran, Ofer; Moran, Shlomo; Zaks, Shmuel}, Deciding 1-solvability of distributed task is \(NP\)-hard, 206-220 [Zbl 0768.68032] \textit{Habib, Michel; Morvan, Michel; Rampon, Jean-Xavier}, Remarks on some concurrency measures, 221-238 [Zbl 0825.68382] \textit{Hoffmann, Frank; Kaufmann, Michael}, On the rectilinear art gallery problem. Algorithmic aspects, 239-250 [Zbl 0767.68092] \textit{Fischer, Paul; Simon, Hans Ulrich}, Separation problems and circular arc systems, 251-259 [Zbl 0767.68091] \textit{Reuter, Klaus; Rival, Ivan}, Genus of orders and lattices, 260-275 [Zbl 0767.68099] \textit{Stewart, Iain A.}, Comparing the expressibility of two languages formed using \(NP\)-complete graph operators, 276-290 [Zbl 0767.68044] \textit{Seipel, Dietmar}, Decomposition of linear recursive logic programs, 291-310 [Zbl 0767.68014] \textit{Caucal, Didier; Monfort, Roland}, On the transition graphs of automata and grammars, 311-337 [Zbl 0768.68124] \textit{Löwe, Michael; Ehrig, Hartmut}, Algebraic approach to graph transformation based on single pushout derivations, 338-353 [Zbl 0768.68069]