Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany - researchr publication

researchr

You are not signed in
Sign in
Sign up

H.-J. Schneider, Herbert Göttler, editors, Proceedings of the 8th Conference Graphtheoretic Concepts in Computer Science (WG '82), Neuenkirchen (near Erlangen), Germany. Hanser, Munich, 1983.

Conference: wg1983

Abstract is missing.

A Relational View on Gotos and Dynamic LogicRudolf Berghammer, Gunther Schmidt 0001. 13-24

Network Flows in Trees and Knapsack Problems with Nested ConstraintsPeter Brucker. 25-36

A Linear Disjoint Path AlgorithmJ. Ebert. 37-46

Specification of a Programming Support Environment by Graph GrammarsGregor Engels, Wilhelm Schäfer. 47-62

A Language for Linearizing GraphicsHerbert Göttler, A. Völk. 63-78

K Best Cuts in Planar and Nonplanar NetworksHorst W. Hamacher. 79-90

Concurrency of Node-Label-Controlled Graph TransformationsDirk Janssens, Hans-Jörg Kreowski, Grzegorz Rozenberg, Hartmut Ehrig. 91-108

Variants of Multidimensional B-Trees as Dynamic Index Structures for Associative Retrieval in Database SystemsHans-Peter Kriegel. 109-128

Decomposing Data for Comparison in Systolic (VLSI) ArraysReinhard Laue. 129-136

On Concurrency Control in Shared B-TreesGeorg Lausen. 137-150

On the Solution of Inequality Systems Relevant to IC-LayoutThomas Lengauer. 151-164

Graph Grammars as a Tool for Description in Computer Processed Control: A Case StudyBernd Mahr, Anne Wilharm. 165-176

Iterative Algorithms on Grammar GraphsUlrich Möncke, Reinhard Wilhelm. 177-194

The Complexity of Determing a Shortest Cycle of Even LengthBurkhard Monien. 195-208

The Complexity of the Vertex Coloring Problem on Hierarchies of Sparse GraphsH. Müller. 209-224

Lowerbounds and Upperbounds on VLSI-Layouts for Perfect Binary TreesMark H. Overmars. 225-232

Flowshop Scheduling with no Wait in Process on Three MachinesHans Röck. 233-250

Kernels in Bipartite GraphsGunther Schmidt 0001, Thomas Ströhlein. 251-256

Reporting Intersections of Line Segments: An Improvement of the Ottmann-Bentley AlgorithmAlfred Schmitt. 257-266

The Separation ProblemOliver Vornberger. 267-280

runs on WebDSL