Kövesdi, Andrea (2000) Legrövidebb utak hálózatokban. ['eprint_fieldopt_thesis_type_master' not defined] thesis, Szegedi Tudományegyetem.
2000_kovesdi_andrea_00_63.pdf - Thesis
Restricted to SZTE designated computers only
Download (1MB)
2000_kovesdi_andrea_00_63_velemeny.pdf - Review
Restricted to Repository staff only
Download (179kB)
| Item Type: | Thesis (['eprint_fieldopt_thesis_type_master' not defined]) |
|---|---|
| Institution: | Szegedi Tudományegyetem |
| ['eprint_fieldname_faculty' not defined]: | Faculty of Science and Mathematics |
| Department: | Számítástudomány Alapjai Tanszék |
| ['eprint_fieldname_specialization' not defined]: | programozó matematikus |
| Discipline: | Informatics |
| Supervisor(s): | Supervisor Supervisor scientific name label Email EHA Bartalos, Dr. István UNSPECIFIED UNSPECIFIED UNSPECIFIED |
| Subjects: | 01. Natural sciences > 01.02. Computer and information sciences |
| Depositing User: | TTK szerkesztő |
| Date Deposited: | 2011. Mar. 12. 10:51 |
| Last Modified: | 2012. Jun. 19. 14:35 |
| URI: | https://diploma.bibl.u-szeged.hu/id/eprint/1914 |


