Raimond, J.-F. Minimaximal paths in disjunctive graphs by direct search. (English) Zbl 0251.90049 IBM J. Res. Dev. 13, 391-399 (1969). 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{J. F. Raimond}, IBM J. Res. Dev. 13, 391--399 (1969; Zbl 0251.90049) Full Text: DOI