|
|
|
|
| LEADER |
02832nam a22005895i 4500 |
| 001 |
10361 |
| 003 |
DE-He213 |
| 005 |
20130725194111.0 |
| 007 |
cr nn 008mamaa |
| 008 |
100301s2010 gw | s |||| 0|eng d |
| 020 |
# |
# |
|a 9783642114090
|9 978-3-642-11409-0
|
| 024 |
7 |
# |
|a 10.1007/978-3-642-11409-0
|2 doi
|
| 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
|
| 100 |
1 |
# |
|a Paul, Christophe.
|e editor.
|
| 245 |
1 |
0 |
|a Graph-Theoretic Concepts in Computer Science
|b 35th International Workshop, WG 2009, Montpellier, France, June 24-26, 2009. Revised Papers /
|c edited by Christophe Paul, Michel Habib.
|h [electronic resource] :
|
| 264 |
# |
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg,
|c 2010.
|
| 300 |
# |
# |
|a XIII, 353p. 59 illus.
|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 5911
|x 0302-9743 ;
|
| 520 |
# |
# |
|a This book constitutes the thoroughly refereed post-conference proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009, held in Montpellier, France, in June 2009. The 28 revised full papers presented together with two invited papers were carefully reviewed and selected from 69 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, diagram methods, and support of these concepts by suitable implementations.
|
| 650 |
# |
0 |
|a Computer science.
|
| 650 |
# |
0 |
|a Data structures (Computer science).
|
| 650 |
# |
0 |
|a Computer software.
|
| 650 |
# |
0 |
|a Computational complexity.
|
| 650 |
# |
0 |
|a Algebra
|x Data processing.
|
| 650 |
# |
0 |
|a Algorithms.
|
| 650 |
# |
0 |
|a Geometry.
|
| 650 |
1 |
4 |
|a Computer Science.
|
| 650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
| 650 |
2 |
4 |
|a Geometry.
|
| 650 |
2 |
4 |
|a Algorithms.
|
| 650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
| 650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
| 650 |
2 |
4 |
|a Data Structures.
|
| 700 |
1 |
# |
|a Habib, Michel.
|e editor.
|
| 710 |
2 |
# |
|a SpringerLink (Online service)
|
| 773 |
0 |
# |
|t Springer eBooks
|
| 776 |
0 |
8 |
|i Printed edition:
|z 9783642114083
|
| 830 |
# |
0 |
|a Lecture Notes in Computer Science,
|v 5911
|x 0302-9743 ;
|
| 856 |
4 |
0 |
|u https://ezaccess.library.uitm.edu.my/login?url=http://dx.doi.org/10.1007/978-3-642-11409-0
|
| 912 |
# |
# |
|a ZDB-2-SCS
|
| 912 |
# |
# |
|a ZDB-2-LNC
|
| 950 |
# |
# |
|a Computer Science (Springer-11645)
|