Häftad, Engelska, 2011
Combinatorial Algorithms
Av Costas S. Iliopoulos, William F. Smyth
559 kr
Skickas inom 10-15 vardagar
Beskrivning
This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.
Produktinformation
- Utgivningsdatum: 2011-03-16
- Mått: 155 x 235 x undefined mm
- Format: Häftad
- Språk: Engelska
- Antal sidor: 418
- Förlag: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
- Serie: Lecture Notes in Computer Science
- ISBN: 9783642192210
Utforska kategorier
Betyg & recensioner
0 recensioner
Inga recensioner tillgängliga.