|
|
|
|
LEADER |
00000nam a22000005i 4500 |
001 |
978-3-642-25011-8 |
003 |
DE-He213 |
005 |
20230222223626.0 |
007 |
cr nn 008mamaa |
008 |
111109s2011 gw | s |||| 0|eng d |
020 |
|
|
|a 9783642250118
|9 978-3-642-25011-8
|
024 |
7 |
|
|a 10.1007/978-3-642-25011-8
|2 doi
|
050 |
|
4 |
|a QA76.9.M35
|
050 |
|
4 |
|a QA297.4
|
072 |
|
7 |
|a UYAM
|2 bicssc
|
072 |
|
7 |
|a PBD
|2 bicssc
|
072 |
|
7 |
|a COM018000
|2 bisacsh
|
072 |
|
7 |
|a UYAM
|2 thema
|
072 |
|
7 |
|a PBD
|2 thema
|
082 |
0 |
4 |
|a 004.0151
|2 23
|
245 |
1 |
0 |
|a Combinatorial Algorithms
|h [electronic resource] :
|b 22th International Workshop, IWOCA 2011, Victoria, Canada, July 20-22, 2011, Revised Selected Papers /
|c edited by Costas S. Iliopoulos, William F. Smyth.
|
250 |
|
|
|a 1st ed. 2011.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2011.
|
300 |
|
|
|a XI, 387 p.
|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 Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 7056
|
520 |
|
|
|a This book constitutes the thoroughly referred post-workshop proceedings of the 22nd International Workshop on Combinatorial Algorithms, IWOCA 2011, held in Vancouver, BC, Canada, in July 2011. The 30 revised full papers presented were carefully reviewed and selected from a total of 71 submissions. A broad variety of topics in combinatorics and graph theory are addressed, such as combinatorics on words, string algorithms, codes, Venn diagrams, set partitions; Hamiltonian & Eulerian properties, graph drawing, colouring, dominating sets, spanning trees, and others.
|
650 |
|
0 |
|a Computer science-Mathematics.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Machine theory.
|
650 |
|
0 |
|a Artificial intelligence-Data processing.
|
650 |
1 |
4 |
|a Discrete Mathematics in Computer Science.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Formal Languages and Automata Theory.
|
650 |
2 |
4 |
|a Data Science.
|
650 |
2 |
4 |
|a Symbolic and Algebraic Manipulation.
|
700 |
1 |
|
|a Iliopoulos, Costas S.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Smyth, William F.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer Nature eBook
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642250101
|
776 |
0 |
8 |
|i Printed edition:
|z 9783642250125
|
830 |
|
0 |
|a Theoretical Computer Science and General Issues,
|x 2512-2029 ;
|v 7056
|
856 |
4 |
0 |
|u https://doi.uam.elogim.com/10.1007/978-3-642-25011-8
|z Texto Completo
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-SXCS
|
912 |
|
|
|a ZDB-2-LNC
|
950 |
|
|
|a Computer Science (SpringerNature-11645)
|
950 |
|
|
|a Computer Science (R0) (SpringerNature-43710)
|