Cargando…

Combinatorial Algorithms 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers /

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 sel...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Iliopoulos, Costas S. (Editor ), Smyth, William F. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:Theoretical Computer Science and General Issues, 6460
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-19222-7
003 DE-He213
005 20230406031128.0
007 cr nn 008mamaa
008 110314s2011 gw | s |||| 0|eng d
020 |a 9783642192227  |9 978-3-642-19222-7 
024 7 |a 10.1007/978-3-642-19222-7  |2 doi 
050 4 |a QA76.9.M35 
050 4 |a QA297.4 
072 7 |a UYAM  |2 bicssc 
072 7 |a PBD  |2 bicssc 
072 7 |a COM018000  |2 bisacsh 
072 7 |a UYAM  |2 thema 
072 7 |a PBD  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Combinatorial Algorithms  |h [electronic resource] :  |b 21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers /  |c edited by Costas S. Iliopoulos, William F. Smyth. 
250 |a 1st ed. 2011. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a XI, 418 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6460 
520 |a 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. 
650 0 |a Computer science-Mathematics. 
650 0 |a Discrete mathematics. 
650 0 |a Algorithms. 
650 0 |a Artificial intelligence-Data processing. 
650 0 |a Coding theory. 
650 0 |a Information theory. 
650 1 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Symbolic and Algebraic Manipulation. 
650 2 4 |a Algorithms. 
650 2 4 |a Data Science. 
650 2 4 |a Coding and Information Theory. 
700 1 |a Iliopoulos, Costas S.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Smyth, William F.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642192210 
776 0 8 |i Printed edition:  |z 9783642192234 
830 0 |a Theoretical Computer Science and General Issues,  |x 2512-2029 ;  |v 6460 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-19222-7  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
912 |a ZDB-2-LNC 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)