Combinatorial Algorithms [electronic resource] : 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers / edited by Costas S. Iliopoulos, William F. Smyth.
Contributor(s): Iliopoulos, Costas S [editor.]
| Smyth, William F [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6460Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: XI, 418 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642192227.Subject(s): Computer science -- Mathematics | Discrete mathematics | Algorithms | Artificial intelligence -- Data processing | Coding theory | Information theory | Discrete Mathematics in Computer Science | Symbolic and Algebraic Manipulation | Algorithms | Data Science | Coding and Information TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004.0151 Online resources: Click here to access online
In:
Springer Nature eBookSummary: 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.
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.
There are no comments for this item.