|
|
|
|
LEADER |
03459nam a22005655i 4500 |
001 |
978-3-319-12340-0 |
003 |
DE-He213 |
005 |
20151204154214.0 |
007 |
cr nn 008mamaa |
008 |
141020s2014 gw | s |||| 0|eng d |
020 |
|
|
|a 9783319123400
|9 978-3-319-12340-0
|
024 |
7 |
|
|a 10.1007/978-3-319-12340-0
|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 Graph-Theoretic Concepts in Computer Science
|h [electronic resource] :
|b 40th International Workshop, WG 2014, Nouan-le-Fuzelier, France, June 25-27, 2014. Revised Selected Papers /
|c edited by Dieter Kratsch, Ioan Todinca.
|
264 |
|
1 |
|a Cham :
|b Springer International Publishing :
|b Imprint: Springer,
|c 2014.
|
300 |
|
|
|a XI, 422 p. 81 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,
|x 0302-9743 ;
|v 8747
|
505 |
0 |
|
|a Design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms -- Structural graph theory with algorithmic or complexity applications -- Computational complexity of graph and network problems -- Graph grammars, graph rewriting systems and graph modeling -- Graph drawing and layouts -- Computational geometry -- Random graphs and models of the web and scale-free networks -- Support of these concepts by suitable implementations and applications.
|
520 |
|
|
|a This book constitutes the thoroughly refereed post-conference proceedings of the 40th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2014, held in Nouan-le-Fuzelier, France, in June 2014. The 32 revised full papers presented were carefully reviewed and selected from 80 submissions. The book also includes two invited papers. The papers cover a wide range of topics in graph theory related to computer science, such as design and analysis of sequential, parallel, randomized, parameterized and distributed graph and network algorithms; structural graph theory with algorithmic or complexity applications; computational complexity of graph and network problems; graph grammars, graph rewriting systems and graph modeling; graph drawing and layouts; computational geometry; random graphs and models of the web and scale-free networks; and support of these concepts by suitable implementations and applications.
|
650 |
|
0 |
|a Computer science.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Computer science
|x Mathematics.
|
650 |
|
0 |
|a Geometry.
|
650 |
1 |
4 |
|a Computer Science.
|
650 |
2 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|
650 |
2 |
4 |
|a Data Structures.
|
650 |
2 |
4 |
|a Geometry.
|
650 |
2 |
4 |
|a Algorithms.
|
700 |
1 |
|
|a Kratsch, Dieter.
|e editor.
|
700 |
1 |
|
|a Todinca, Ioan.
|e editor.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783319123394
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 8747
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-319-12340-0
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (Springer-11645)
|