|
|
|
|
| LEADER |
02683nam a22005655i 4500 |
| 001 |
978-3-642-19222-7 |
| 003 |
DE-He213 |
| 005 |
20170107152128.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
|
| 040 |
|
|
|d GrThAP
|
| 050 |
|
4 |
|a QA76.9.M35
|
| 072 |
|
7 |
|a PBD
|2 bicssc
|
| 072 |
|
7 |
|a UYAM
|2 bicssc
|
| 072 |
|
7 |
|a COM018000
|2 bisacsh
|
| 072 |
|
7 |
|a MAT008000
|2 bisacsh
|
| 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.
|
| 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 Lecture Notes in Computer Science,
|x 0302-9743 ;
|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.
|
| 650 |
|
0 |
|a Data structures (Computer science).
|
| 650 |
|
0 |
|a Coding theory.
|
| 650 |
|
0 |
|a Algorithms.
|
| 650 |
|
0 |
|a Computer science
|x Mathematics.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Coding and Information Theory.
|
| 700 |
1 |
|
|a Iliopoulos, Costas S.
|e editor.
|
| 700 |
1 |
|
|a Smyth, William F.
|e editor.
|
| 710 |
2 |
|
|a SpringerLink (Online service)
|
| 773 |
0 |
|
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642192210
|
| 830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 6460
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-642-19222-7
|z Full Text via HEAL-Link
|
| 912 |
|
|
|a ZDB-2-SCS
|
| 912 |
|
|
|a ZDB-2-LNC
|
| 950 |
|
|
|a Computer Science (Springer-11645)
|
