Graph-Theoretic Concepts in Computer Science 30th International Workshop, Wg 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers

Author/creator Hromkovic, Juraj Editor
Other author Nagl, Manfred Editor
Other author Westfechtel, Bernhard Editor
Format Electronic
Publication InfoNew York : Springer
DescriptionXI, 404 p. 23.500 x 015.500 cm.
Supplemental ContentFull text available from SpringerLINK Lecture Notes in Computer Science Contemporary (1997-present)
Subjects

SeriesLecture Notes in Computer Science Ser.
Summary Annotation 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.
Access restrictionAvailable only to authorized users.
Technical detailsMode of access: World Wide Web
Genre/formElectronic books.
ISBN9783540241324
ISBN3540241329 (Trade Paper) Active Record
Standard identifier# 9783540241324
Stock number3540241329 00024965

Availability

Library Location Call Number Status Item Actions
Electronic Resources Access Content Online ✔ Available