| Bespamyatnikh, S and Kelarev, AV, “Algorithms for shortest paths and d-cycle problems”, Journal of Discrete Algorithms, 1 (1) pp. 1-9. ISSN 1570-8667 (2003) [Refereed Article] |
| Data Type | Value |
|---|
| Type of Research | Strategic Basic Research |
| Research Division | Information and Computing Sciences |
| Research Group | Theory of computation |
| Research Field | Data structures and algorithms |
| Research Objective Division | Information and Communication Services |
| Research Objective Group | Information systems, technologies and services |
| Research Objective Field | Information systems, technologies and services not elsewhere classified |
| Visit Item on eCite | http://ecite.utas.edu.au/27383 |
| Digital Object Identifier | doi:10.1016/S1570-8667(03)00002-9 |
| Scopus Source URL | View the full record on Scopus |
| Scopus Citing URL | View the list of citing articles on Scopus |
| Number of Times Cited | 1 |
