000 | 03580nam a22006735i 4500 | ||
---|---|---|---|
001 | 978-3-031-15914-5 | ||
003 | DE-He213 | ||
005 | 20240730201458.0 | ||
007 | cr nn 008mamaa | ||
008 | 220930s2022 sz | s |||| 0|eng d | ||
020 |
_a9783031159145 _9978-3-031-15914-5 |
||
024 | 7 |
_a10.1007/978-3-031-15914-5 _2doi |
|
050 | 4 | _aQA76.9.M35 | |
050 | 4 | _aQA297.4 | |
072 | 7 |
_aUYAM _2bicssc |
|
072 | 7 |
_aPBD _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
072 | 7 |
_aUYAM _2thema |
|
072 | 7 |
_aPBD _2thema |
|
082 | 0 | 4 |
_a004.0151 _223 |
245 | 1 | 0 |
_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b48th International Workshop, WG 2022, Tübingen, Germany, June 22-24, 2022, Revised Selected Papers / _cedited by Michael A. Bekos, Michael Kaufmann. |
250 | _a1st ed. 2022. | ||
264 | 1 |
_aCham : _bSpringer International Publishing : _bImprint: Springer, _c2022. |
|
300 |
_aXV, 454 p. 144 illus., 57 illus. in color. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13453 |
|
505 | 0 | _aDesign and analysis of sequential, parallel, randomized, parameterized algorithms. 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 -- Computational biology -- Graph mining -- Random graphs and models of the web and scale-free networks. | |
520 | _aThis LNCS 13453 constitutes the thoroughly refereed proceedings of the 48th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2022.The 32 full papers presented in this volume were carefully reviewed and selected from a total of 96 submissions. The WG 2022 workshop aims to merge theory and practice by demonstrating how concepts from Graph Theory can be applied to various areas in Computer Science, or by extracting new graph theoretic problems from applications. | ||
650 | 0 |
_aComputer science _xMathematics. _93866 |
|
650 | 0 |
_aDiscrete mathematics. _912873 |
|
650 | 0 |
_aData structures (Computer science). _98188 |
|
650 | 0 |
_aInformation theory. _914256 |
|
650 | 0 |
_aAlgorithms. _93390 |
|
650 | 0 |
_aComputer graphics. _94088 |
|
650 | 0 |
_aNumerical analysis. _94603 |
|
650 | 1 | 4 |
_aDiscrete Mathematics in Computer Science. _931837 |
650 | 2 | 4 |
_aData Structures and Information Theory. _931923 |
650 | 2 | 4 |
_aDesign and Analysis of Algorithms. _931835 |
650 | 2 | 4 |
_aComputer Graphics. _94088 |
650 | 2 | 4 |
_aNumerical Analysis. _94603 |
650 | 2 | 4 |
_aSymbolic and Algebraic Manipulation. _955589 |
700 | 1 |
_aBekos, Michael A. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9167343 |
|
700 | 1 |
_aKaufmann, Michael. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt _9167344 |
|
710 | 2 |
_aSpringerLink (Online service) _9167345 |
|
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783031159138 |
776 | 0 | 8 |
_iPrinted edition: _z9783031159152 |
830 | 0 |
_aLecture Notes in Computer Science, _x1611-3349 ; _v13453 _923263 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-031-15914-5 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cELN | ||
999 |
_c96552 _d96552 |