| Bespamyatnikh, SN and Kelarev, AV, “Shortest paths and d-cycle problem”, Combinatorial Algorithms, August 1999, Perth, pp. 152-156. (1999) [Refereed Conference Paper] |
| Data Type | Value |
|---|
| Type of Research | Applied Research |
| Research Division | Information and Computing Sciences |
| Research Group | Theory of computation |
| Research Field | Computational complexity and computability |
| 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/16042 |
