Geodesic
R-separating Sets
Canadian journal of mathematics, Tome 26 (1974) no. 6, pp. 1418-1429

Voir la notice de l'article provenant de la source Cambridge University Press

This study of r-separating sets was originally motivated by the maximum-flow-minimum-cut theorem of finite networks [1 ; 2]. In working toward a continuous version of the maximum-flow-minimum-cut theorem from the usual discrete version, one is led directly to the notion of r-connectedness of a set as defined below. This notion of r-connectedness also has a very simple intuitive interpretation. Intuitively speaking, a set of points in the plane is r-connected if a person starting at any one point of the set is able to reach any other point of the set by jumping from point to point within the set, but never jumping a distance exceeding r in any one jump. 
Gomory, R. E.; Hu, T. C.; Yohe, J. M. R-separating Sets. Canadian journal of mathematics, Tome 26 (1974) no. 6, pp. 1418-1429. doi: 10.4153/CJM-1974-136-9
@article{10_4153_CJM_1974_136_9,
     author = {Gomory, R. E. and Hu, T. C. and Yohe, J. M.},
     title = {R-separating {Sets}},
     journal = {Canadian journal of mathematics},
     pages = {1418--1429},
     year = {1974},
     volume = {26},
     number = {6},
     doi = {10.4153/CJM-1974-136-9},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-136-9/}
}
TY  - JOUR
AU  - Gomory, R. E.
AU  - Hu, T. C.
AU  - Yohe, J. M.
TI  - R-separating Sets
JO  - Canadian journal of mathematics
PY  - 1974
SP  - 1418
EP  - 1429
VL  - 26
IS  - 6
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-136-9/
DO  - 10.4153/CJM-1974-136-9
ID  - 10_4153_CJM_1974_136_9
ER  - 
%0 Journal Article
%A Gomory, R. E.
%A Hu, T. C.
%A Yohe, J. M.
%T R-separating Sets
%J Canadian journal of mathematics
%D 1974
%P 1418-1429
%V 26
%N 6
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1974-136-9/
%R 10.4153/CJM-1974-136-9
%F 10_4153_CJM_1974_136_9

[1] 1. Ford, L. R., Jr., and Fulkerson, P. R., Maximal flow through a network, Can. J. Math. 8 (1956), 399–404. Google Scholar

[2] 2. Hu, T. C., Integer programming and network flows (Addison-Wesley, Reading, Mass., 1969), pp. 214–224. Google Scholar

[3] 3. Newman, M. H. A., Elements of the topology of plane sets of points (Cambridge University Press, New York, 1961). Google Scholar

Cité par Sources :