eCite Digital Repository

Shortest paths and d-cycle problem

Citation

Bespamyatnikh, SN and Kelarev, AV, Shortest paths and d-cycle problem, Combinatorial Algorithms, August 1999, Perth, pp. 152-156. (1999) [Refereed Conference Paper]

Item Details

Item Type:Refereed Conference Paper
Research Division:Information and Computing Sciences
Research Group:Computation Theory and Mathematics
Research Field:Analysis of Algorithms and Complexity
Objective Division:Information and Communication Services
Objective Group:Computer Software and Services
Objective Field:Information Processing Services (incl. Data Entry and Capture)
Author:Kelarev, AV (Dr Andrei Kelarev)
ID Code:16042
Year Published:1999
Deposited By:Mathematics
Deposited On:1999-08-01
Last Modified:2000-05-20
Downloads:0

Repository Staff Only: item control page