WALCOM: Algorithms and Computation [electronic resource] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29-31, 2016, Proceedings / edited by Mohammad Kaykobad, Rossella Petreschi.
Material type:
TextSeries: Theoretical Computer Science and General Issues ; 9627 | Lecture Notes in Computer Science ; 9627Publisher: Cham : Springer International Publishing : Imprint: Springer, 2016Edition: 1st ed. 2016Description: XIX, 362 p. 82 illus. in color. online resourceContent type: text Media type: computer Carrier type: online resourceISBN: 9783319301396Subject(s): Algorithms | Computer science—Mathematics | Computer graphics | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Math Applications in Computer Science | Symbolic and Algebraic Manipulation | Computer Graphics | AlgorithmsAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 005.1 LOC classification: QA76.9.A43Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.
E-BOOKS
| Current library | Home library | Call number | Materials specified | URL | Status | Date due | Barcode |
|---|---|---|---|---|---|---|---|
| IMSc Library | IMSc Library | Link to resource | Available | EBK15259 |
This book constitutes the proceedings of the 10th International Workshop on Algorithms and Computation, WALCOM 2016, held in Kathmandu, Nepal, in March 2016. The 27 full papers presented together with 4 invited talks were carefully reviewed and selected from 68 submissions. The papers cover a wide range of topics such as approximation algorithms, computational complexity, computational geometry, data structures, graph algorithms, graph coloring, graph exploration, and online algorithms.
There are no comments on this title.