Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3353)
Conference series link(s): WG: International Workshop on Graph-Theoretic Concepts in Computer Science
Conference proceedings info: WG 2004.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (33 papers)
-
Front Matter
-
Graph Algorithms: Recognition and Decomposition
-
Graph Algorithms: Various Problems
About this book
Editors and Affiliations
-
Department of Computer Science, ETH Zurich, ETH Zentrum, Zurich, Switzerland
Juraj Hromkovič
-
Department of Computer Science, RWTH Aachen, Chair of Computer Science III, Aachen, Germany
Manfred Nagl
-
Department of Computer Science III, RWTH Aachen University, Aachen, Germany
Bernhard Westfechtel
Bibliographic Information
Book Title: Graph-Theoretic Concepts in Computer Science
Book Subtitle: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Editors: Juraj Hromkovič, Manfred Nagl, Bernhard Westfechtel
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b104584
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2005
Softcover ISBN: 978-3-540-24132-4Published: 21 December 2004
eBook ISBN: 978-3-540-30559-0Published: 25 January 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: XI, 404
Topics: Theory of Computation, Simulation and Modeling, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Numeric Computing, Data Structures