ENGLISH

Graph-Theoretic Concepts in Computer Science: 27th InternationalWorkshop, WG 2001 Boltenhagen, Germany, June 14–16, 2001 Proceedings

By Hans-J. Bandelt (auth.) , Andreas Brandstädt , Van Bang Le (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2001
ISBN
978-3-540-42707-0, 978-3-540-45477-9, 3-540-42707-4
DOI
10.1007/3-540-45477-2
Language
english
Format
PDF
Filesize
4 MB (3973082 bytes)
Series
Lecture Notes in Computer Science 2204
Edition
1
Pages
334\339
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

This book constitutes the thoroughly refereed post-workshop proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001, held in Boltenhagen, Germany, in June 2001. The 27 revised full papers presented together with two invited contributions were carefully reviewed and selected from numerous submissions. The papers provide a wealth of new results for various classes of graphs, graph computations, graph algorithms and graph-theoretical applications in various fields.

Similar books