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.
Material type:
TextSeries: Lecture Notes in Computer Science ; 6460Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: XI, 418 p. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783642192227Subject(s): Computer science | Data structures (Computer science) | Coding theory | Computer software | Computational complexity | Algebra -- Data processing | Algorithms | Computer Science | Discrete Mathematics in Computer Science | Symbolic and Algebraic Manipulation | Algorithm Analysis and Problem Complexity | Data Structures | Algorithms | Coding and Information TheoryAdditional physical formats: Printed edition:: No titleDDC classification: 004.0151 LOC classification: QA76.9.M35 Online resources: Click here to access online
In:
Springer eBooksSummary: 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.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK9522 |
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 on this title.