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.
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.
Imprint | Springer-Verlag |
Country of origin | Germany |
Release date | November 2004 |
Availability | We don't currently have any sources for this product. If you add this item to your wish list we will let you know when it becomes available. |
Authors | Juraj Hromkovic, Manfred Nagl, Bernhard Westfechtel |
Format | Electronic book text |
ISBN-13 | 978-3-540-30559-0 |
Barcode | 9783540305590 |
Categories | |
LSN | 3-540-30559-9 |