| 000 | 02669nam a22006015i 4500 | ||
|---|---|---|---|
| 001 | 978-3-642-25870-1 | ||
| 003 | DE-He213 | ||
| 005 | 20160624102207.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 111129s2011 gw | s |||| 0|eng d | ||
| 020 |
_a9783642258701 _9978-3-642-25870-1 |
||
| 024 | 7 |
_a10.1007/978-3-642-25870-1 _2doi |
|
| 050 | 4 | _aQA76.9.M35 | |
| 072 | 7 |
_aPBD _2bicssc |
|
| 072 | 7 |
_aUYAM _2bicssc |
|
| 072 | 7 |
_aCOM018000 _2bisacsh |
|
| 072 | 7 |
_aMAT008000 _2bisacsh |
|
| 082 | 0 | 4 |
_a004.0151 _223 |
| 245 | 1 | 0 |
_aGraph-Theoretic Concepts in Computer Science _h[electronic resource] : _b37th International Workshop, WG 2011, Teplá Monastery, Czech Republic, June 21-24, 2011. Revised Papers / _cedited by Petr Kolman, Jan Kratochvíl. |
| 260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
| 264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2011. |
|
| 300 |
_aXI, 344 p. _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, _x0302-9743 ; _v6986 |
|
| 520 | _aThis book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Teplá Monastery, Czech Republic, in June 2011. The 28 revised papers presented were carefully reviewed and selected from 52 submissions. The workshop aims at merging theory and practice by demonstrating how concepts from graph theory can be applied to various areas in computer science, and by extracting new graph theoretic problems from applications. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer Communication Networks. | |
| 650 | 0 | _aData structures (Computer science). | |
| 650 | 0 | _aComputer software. | |
| 650 | 0 | _aComputational complexity. | |
| 650 | 0 | _aAlgorithms. | |
| 650 | 0 | _aGeometry. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
| 650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
| 650 | 2 | 4 | _aGeometry. |
| 650 | 2 | 4 | _aAlgorithms. |
| 650 | 2 | 4 | _aComputer Communication Networks. |
| 650 | 2 | 4 | _aData Structures. |
| 700 | 1 |
_aKolman, Petr. _eeditor. |
|
| 700 | 1 |
_aKratochvíl, Jan. _eeditor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9783642258695 |
| 786 | _dSpringer | ||
| 830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v6986 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-3-642-25870-1 |
| 942 |
_2EBK10064 _cEBK |
||
| 999 |
_c39358 _d39358 |
||