RAIRO - Operations Research

Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph

P. Miliotis, G. Laporte and Y. Nobert

RAIRO-Oper. Res., 15 3 (1981) 233-239

Published online: 06 February 2017

DOI: 10.1051/ro/1981150302331

P. Miliotis

G. Laporte

Y. Nobert

Articles written by ALL the selected authors (AND)

Articles written by ANY OF the selected authors (OR)