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.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 6460Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Descripción: XI, 418 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783642192227Trabajos contenidos: SpringerLink (Online service)Tema(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 TheoryFormatos físicos adicionales: Sin títuloClasificación CDD: 004.0151 Clasificación LoC:QA76.9.M35Recursos en línea: de clik aquí para ver el libro electrónico Springer eBooksResumen: 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.
No hay ítems correspondientes a este registro
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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.