Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1665)
Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science
Conference proceedings info: WG 1999.
Buying options
This is a preview of subscription content, access via your institution.
Table of contents (37 papers)
-
Front Matter
Keywords
- Graph
- Graph computations
- Matching
- Matchings
- Partition
- Permutation
- algorithms
- approximation
- combinatorial optimization
- complexity
- computational geometry
- garph drawing
- geometry algorithms
- graph algorithms
- graph coloring
- algorithm analysis and problem complexity
- combinatorics
- data structures
Editors and Affiliations
-
Institute for Theoretical Computer Science ETH Zürich ETH Zentrum, Zürich, Switzerland
Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz
Bibliographic Information
Book Title: Graph-Theoretic Concepts in Computer Science
Book Subtitle: 25th International Workshop, WG'99, Ascona, Switzerland, June 17-19, 1999 Proceedings
Editors: Peter Widmayer, Gabriele Neyer, Stephan Eidenbenz
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/3-540-46784-X
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1999
Softcover ISBN: 978-3-540-66731-5Published: 27 October 1999
eBook ISBN: 978-3-540-46784-7Published: 26 June 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 416
Topics: Theory of Computation, Algorithms, Discrete Mathematics, Data Science, Computer Graphics