|
|
|
|
| LEADER |
00919naa a2200253 i 4500 |
| 001 |
NSK01001114234 |
| 003 |
HR-ZaNSK |
| 005 |
20211006105622.0 |
| 007 |
ta |
| 008 |
211006s2019 ci d | |0|| ||hrv |
| 035 |
|
|
|a (HR-ZaNSK)001114234
|
| 040 |
|
|
|a HR-ZaNSK
|b hrv
|c HR-ZaNSK
|e ppiak
|
| 042 |
|
|
|a croatica
|
| 044 |
|
|
|a ci
|c hr
|
| 080 |
1 |
|
|a 004
|2 2011
|
| 100 |
1 |
|
|a Karaata, Mehmet Hakan
|4 aut
|9 HR-ZaNSK
|
| 245 |
1 |
3 |
|a An algorithm for finding two node-disjoint paths in arbitrary graphs /
|c Mehmet Hakan Karaata.
|
| 300 |
|
|
|b Graf. prikazi.
|
| 504 |
|
|
|a Bibliografija: 26 jed.
|
| 653 |
|
0 |
|a Distribuirani sustavi
|a Tolerancija pogrešaka
|a Mrežno usmjeravanje
|a Mrežna sigurnost
|
| 773 |
0 |
|
|t CIT. Journal of computing and information technology
|x 1330-1136
|g 27 (2019), 3 ; str. 1-14
|w nsk.(HR-ZaNSK)000018028
|
| 981 |
|
|
|b B06/19
|
| 998 |
|
|
|b migo2110
|
| 856 |
4 |
1 |
|u https://hrcak.srce.hr/237989
|y Elektronička verzija članka
|