Roy, B.; Galland, D. Enumeration des chemins \(\varepsilon\)-minimum admissibles entre deux points. (French) Zbl 0267.90090 Rev. Franc. Automat. Inform. Rech. Operat. 7, V-3, 3-20 (1973). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page MSC: 90C35 Programming involving graphs or networks 05C35 Extremal problems in graph theory PDF BibTeX XML Cite \textit{B. Roy} and \textit{D. Galland}, Rev. Franc. Automat. Inform. Rech. Operat., V 7, No. 3, 3--20 (1973; Zbl 0267.90090) Full Text: DOI EuDML