Article contents
R-separating Sets
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1974
References
- 1
- Cited by