About these proceedings
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.
combinatorial enumeration computational complexity graph coloring graph labeling hypergraphs matrix computation network routing alorithms parameterized algorithms parameterized complexity problem complexity shortest path computation string matching tree matching
Springer Berlin Heidelberg 2011
Springer, Berlin, Heidelberg
Series Print ISSN
Series Online ISSN
Buy this book on publisher's site