Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2204)
Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science
Conference proceedings info: WG 2001.
Buying options
This is a preview of subscription content, access via your institution.
Table of contents (29 papers)
-
Front Matter
About this book
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.
Keywords
- Approximation
- Computational Discrete Mathematics
- Computational Geometry
- Geometric Algorithms
- Graph
- Graph Coloring
- Graph Drawing
- Network Algoritms
- Optimization
- algorithms
- computer
- computer science
- algorithm analysis and problem complexity
- data structures
Editors and Affiliations
-
Department of Computer Science, University of Rostock, Rostock, Germany
Andreas Brandstädt, Van Bang Le
Bibliographic Information
Book Title: Graph-Theoretic Concepts in Computer Science
Book Subtitle: 27th International Workshop, WG 2001 Boltenhagen, Germany, June 14-16, 2001 Proceedings
Editors: Andreas Brandstädt, Van Bang Le
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-45477-2
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2001
Softcover ISBN: 978-3-540-42707-0Published: 26 September 2001
eBook ISBN: 978-3-540-45477-9Published: 01 January 2001
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 334
Topics: Programming Techniques, Theory of Computation, Data Structures and Information Theory, Algorithms, Discrete Mathematics in Computer Science, Data Science