WALCOM: Algorithms and Computation [recurso electrónico] : 10th International Workshop, WALCOM 2016, Kathmandu, Nepal, March 29?31, 2016, Proceedings / edited by Mohammad Kaykobad, Rossella Petreschi.
Tipo de material:
TextoSeries Lecture Notes in Computer Science ; 9627Editor: Cham : Springer International Publishing : Imprint: Springer, 2016Edición: 1st ed. 2016Descripción: XIX, 362 p. 82 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783319301396Tema(s): Computer science | Algorithms | Computer science -- Mathematics | Computer graphics | Computer Science | Algorithm Analysis and Problem Complexity | Discrete Mathematics in Computer Science | Math Applications in Computer Science | Symbolic and Algebraic Manipulation | Computer Graphics | AlgorithmsFormatos físicos adicionales: Printed edition:: Sin títuloClasificación CDD: 005.1 Clasificación LoC:QA76.9.A43Recursos en línea: Libro electrónico
En: Springer eBooksResumen: 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.
| Tipo de ítem | Biblioteca actual | Colección | Signatura | Copia número | Estado | Fecha de vencimiento | Código de barras |
|---|---|---|---|---|---|---|---|
| Libro Electrónico | Biblioteca Electrónica | Colección de Libros Electrónicos | 1 | No para préstamo |
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.
