000 | 02985nam a22006375i 4500 | ||
---|---|---|---|
001 | 978-3-642-19222-7 | ||
003 | DE-He213 | ||
005 | 20240423130003.0 | ||
007 | cr nn 008mamaa | ||
008 | 110314s2011 gw | s |||| 0|eng d | ||
020 |
_a9783642192227 _9978-3-642-19222-7 |
||
024 | 7 |
_a10.1007/978-3-642-19222-7 _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 |
_aCombinatorial Algorithms _h[electronic resource] : _b21st International Workshop, IWOCA 2010, London, UK, July 26-28, 2010, Revised Selected Papers / _cedited by Costas S. Iliopoulos, William F. Smyth. |
250 | _a1st ed. 2011. | ||
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg : _bImprint: Springer, _c2011. |
|
300 |
_aXI, 418 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6460 |
|
520 | _aThis book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed. | ||
650 | 0 |
_aComputer science _xMathematics. |
|
650 | 0 | _aDiscrete mathematics. | |
650 | 0 | _aAlgorithms. | |
650 | 0 |
_aArtificial intelligence _xData processing. |
|
650 | 0 | _aCoding theory. | |
650 | 0 | _aInformation theory. | |
650 | 1 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aSymbolic and Algebraic Manipulation. |
650 | 2 | 4 | _aAlgorithms. |
650 | 2 | 4 | _aData Science. |
650 | 2 | 4 | _aCoding and Information Theory. |
700 | 1 |
_aIliopoulos, Costas S. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
700 | 1 |
_aSmyth, William F. _eeditor. _4edt _4http://id.loc.gov/vocabulary/relators/edt |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer Nature eBook | |
776 | 0 | 8 |
_iPrinted edition: _z9783642192210 |
776 | 0 | 8 |
_iPrinted edition: _z9783642192234 |
830 | 0 |
_aTheoretical Computer Science and General Issues, _x2512-2029 ; _v6460 |
|
856 | 4 | 0 | _uhttps://doi.org/10.1007/978-3-642-19222-7 |
912 | _aZDB-2-SCS | ||
912 | _aZDB-2-SXCS | ||
912 | _aZDB-2-LNC | ||
942 | _cSPRINGER | ||
999 |
_c183818 _d183818 |