Ebook: Graph-Theoretic Concepts in Computer Science: 18th International Workshop, WG '92 Wiesbaden-Naurod, Germany, June 18–20, 1992 Proceedings
- Genre: Computers
- Tags: Algorithm Analysis and Problem Complexity, Combinatorics, Computation by Abstract Devices, Logics and Meanings of Programs, Mathematical Logic and Formal Languages, Data Structures
- Series: Lecture Notes in Computer Science 657
- Year: 1993
- Publisher: Springer-Verlag Berlin Heidelberg
- Edition: 1
- Language: English
- djvu
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.
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.