Overview
This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004.The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and exponential algorithms; counting, combinatorics, and optimization; applications in bioinformatics and graph drawing; and graph classes and NP-hard problems.
Full Product Details
Author: Juraj Hromkovič ,
Manfred Nagl ,
Bernhard Westfechtel
Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Edition: 2005 ed.
Volume: 3353
Dimensions:
Width: 15.50cm
, Height: 2.10cm
, Length: 23.50cm
Weight: 1.310kg
ISBN: 9783540241324
ISBN 10: 3540241329
Pages: 404
Publication Date: 21 December 2004
Audience:
Professional and scholarly
,
Professional & Vocational
Format: Paperback
Publisher's Status: Active
Availability: In Print

This item will be ordered in for you from one of our suppliers. Upon receipt, we will promptly dispatch it out to you. For in store availability, please contact us.