ENGLISH

Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings

By Andreas Brandstädt (auth.) , Ernst W. Mayr (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1993
ISBN
3540564020, 9783540564027
DOI
10.1007/3-540-56402-0
LCC
QA166 .G715 1992
Open Library ID
OL21198196M
Language
english
Format
DJVU
Filesize
3 MB (2860907 bytes)
Series
Lecture Notes in Computer Science 657
Edition
1
Pages
355\359
Topic
Computers
Library
Kolxo3
DPI
300
Time added
2009-12-04 00:34:26
Algorithm Analysis and Problem Complexity; Combina

Description

The 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '92) was held in Wiesbaden-Naurod, Germany, June 18-20, 1992. Itwas organized by the Department of Computer Science, Johann Wolfgang Goethe University, Frankfurt am Main. Contributions with original results inthe study and application of graph-theoretic concepts in various fields of computer science were solicited, and 72 papers were submitted and reviewed, from which 29 were selected for presentation at the workshop. The workshop was attended by 61 scientists from 16 countries. All 29 papers in the volume have undergone careful revision after the meeting, based on the discussions and comments from the audience and the referees. The volume is divided into parts on restricted graph classes, scheduling and related problems, parallel anbd distributed algorithms, combinatorial graph problems, graph decomposition, graph grammars and geometry, and modelling by graphs.

Similar books