![](/img/cover-not-exists.png)
A note on finding a shortest complete cycle in an undirected graph
A. Volgenant, R. Jonker, G.A.P. KindervaterVolume:
23
Year:
1986
Language:
english
Pages:
4
DOI:
10.1016/0377-2217(86)90217-1
File:
PDF, 329 KB
english, 1986