ENGLISH

Graph-Theoretic Concepts in Computer Science: International Workshop WG '87 Kloster Banz/Staffelstein, FRG, June 29 – July 1, 1987 Proceedings

By Hartmut Ehrig , Paul Boehm , Udo- Hummert (auth.) , Herbert Göttler , Hana-Jürgen Schneider (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1988
ISBN
3540194223, 9783540194224
DOI
10.1007/3-540-19422-3
Open Library ID
OL12772781M
Language
english
Format
DJVU
Filesize
2 MB (2387208 bytes)
Series
Lecture Notes in Computer Science 314
Edition
1
Pages
256\259
Topic
Computers
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity

Description

This book reflects the scientific program of the annual workshop on Graph-theoretic Concepts in Computer Science in 1987. The purpose of this conference is to be the "missing link" between theory and application of graphs in as many branches of computer science as a conference scheduled for three days without parallel sessions can permit. So the organizers of WG '87 addressed a selected group of people with a strong interest in theory and practice. The proceedings include latest results on "classical" graph-theoretic problems (including formal language theory applied to graphs) and how to apply those results to practical problems, e.g. data bases, layout of graph operating systems, software engineering, chemistry, and modelling with graphs.

Similar books