|
|
|
|
LEADER |
02655nam a22005655i 4500 |
001 |
6838 |
003 |
DE-He213 |
005 |
20130725191034.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 gw | s |||| 0|eng d |
020 |
# |
# |
|a 9783642002021
|9 978-3-642-00202-1
|
024 |
7 |
# |
|a 10.1007/978-3-642-00202-1
|2 doi
|
050 |
# |
4 |
|a QA76.9.A43
|
072 |
# |
7 |
|a UMB
|2 bicssc
|
072 |
# |
7 |
|a COM051300
|2 bisacsh
|
082 |
0 |
4 |
|a 005.1
|2 23
|
100 |
1 |
# |
|a Das, Sandip.
|e editor.
|
245 |
1 |
0 |
|a WALCOM: Algorithms and Computation
|b Third International Workshop, WALCOM 2009, Kolkata, India, February 18-20, 2009. Proceedings /
|c edited by Sandip Das, Ryuhei Uehara.
|h [electronic resource] :
|
264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2009.
|
300 |
# |
# |
|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,
|v 5431
|x 0302-9743 ;
|
520 |
# |
# |
|a This book constitutes the refereed proceedings of the Third International Workshop on Algorithms and Computation, WALCOM 2009, held in Kolkata, India, in February 2009. The 30 revised full papers presented together with 4 invited papers were carefully reviewed and selected from 102 submissions. The papers feature original research in the areas of design and analysis of algorithms, computational geometry, graph drawing and graph algorithms. The papers are organized in topical sections on computational geometry, graph algorithms, complexity, graph drawing, approximation algorithms, and randomized algorithms.
|
650 |
# |
0 |
|a Computer science.
|
650 |
# |
0 |
|a Computer Communication Networks.
|
650 |
# |
0 |
|a Computer software.
|
650 |
# |
0 |
|a Electronic data processing.
|
650 |
# |
0 |
|a Computational complexity.
|
650 |
# |
0 |
|a Computer graphics.
|
650 |
# |
0 |
|a Bioinformatics.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Numeric Computing.
|
650 |
2 |
4 |
|a Computer Communication Networks.
|
650 |
2 |
4 |
|a Computer Graphics.
|
650 |
2 |
4 |
|a Computational Biology/Bioinformatics.
|
700 |
1 |
# |
|a Uehara, Ryuhei.
|e editor.
|
710 |
2 |
# |
|a SpringerLink (Online service)
|
773 |
0 |
# |
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642002014
|
830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5431
|x 0302-9743 ;
|
856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-00202-1
|
912 |
# |
# |
|a ZDB-2-SCS
|
912 |
# |
# |
|a ZDB-2-LNC
|
950 |
# |
# |
|a Computer Science (Springer-11645)
|