|
|
|
|
LEADER |
01821aam a2200481 i 4500 |
001 |
95449 |
003 |
CZ ZlUTB |
005 |
20200506112043.0 |
007 |
ta |
008 |
150416t20132013gw a f 001 0 eng d |
999 |
|
|
|c 95449
|d 95449
|
020 |
|
|
|a 978-3-642-32277-8
|q (vázáno)
|
040 |
|
|
|a DLC
|b cze
|c DLC
|d ABA001
|d ZLD002
|e rda
|
044 |
|
|
|a gw
|a xxu
|a ne
|a xxk
|
072 |
|
7 |
|a 519.1/.8
|x Kombinatorika. Teorie grafů. Matematická statistika. Operační výzkum. Matematické modelování
|2 Konspekt
|9 13
|
080 |
|
|
|a 519.17
|2 MRF
|
080 |
|
|
|a 519.178
|2 MRF
|
080 |
|
|
|a 519.85:519.1
|2 MRF
|
080 |
|
|
|a (048.8)
|2 MRF
|
100 |
1 |
|
|a Jungnickel, Dieter,
|d 1952-
|7 mub2010614572
|4 aut
|
245 |
1 |
0 |
|a Graphs, networks and algorithms /
|c Dieter Jungnickel
|
250 |
|
|
|a Fourth edition
|
264 |
|
1 |
|a Heidelberg ;
|a New York ;
|a Dordrecht ;
|a London :
|b Springer,
|c [2013]
|
264 |
|
4 |
|c ©2013
|
300 |
|
|
|a xx, 675 stran :
|b ilustrace ;
|c 24 cm
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a bez média
|b n
|2 rdamedia
|
338 |
|
|
|a svazek
|b nc
|2 rdacarrier
|
490 |
1 |
|
|a Algorithms and computation in mathematics,
|x 1431-1550 ;
|v volume 5
|
504 |
|
|
|a Obsahuje bibliografické odkazy a rejstřík
|
650 |
0 |
7 |
|a teorie grafů
|7 ph126555
|2 czenas
|
650 |
0 |
7 |
|a grafové algoritmy
|7 ph770865
|2 czenas
|
650 |
0 |
7 |
|a kombinatorická optimalizace
|7 ph359633
|2 czenas
|
650 |
0 |
9 |
|a graph theory
|2 eczenas
|
650 |
0 |
9 |
|a graph algorithms
|2 eczenas
|
650 |
0 |
9 |
|a combinatorial optimization
|2 eczenas
|
655 |
|
7 |
|a monografie
|7 fd132842
|2 czenas
|
655 |
|
9 |
|a monographs
|2 eczenas
|
830 |
|
0 |
|a Algorithms and computation in mathematics
|
910 |
|
|
|a ZLD002
|
942 |
|
|
|2 udc
|
992 |
|
|
|a BK
|b SK
|
952 |
|
|
|0 0
|1 0
|4 0
|6 519JUNGNICKELD
|7 0
|8 BOOK
|9 155276
|a UTBZL
|b UTBZL
|c 005
|d 2020-04-16
|o 519/JUNGNICKEL,D.
|p 420010183190
|r 2020-04-16
|v 760.00
|x N: nákup;
|y 01
|