Limited access: U-M users only
Access by request
Access via HathiTrust
Access via Fulcrum
Now showing items 1-7 of 7
A graph theory interpretation of nodal regions
(Springer-Verlag; The Regional Science Association, 1961-12)
The techniques defined in this paper will divide a set of cities into subgroups which specify a central place and its subordinate hierarchy. The association between cities is not the only system which may be defined as a ...
(950.1KB)
An approach to the direct measurement of community mean information fields
(Springer-Verlag; The Regional Science Association, 1963-12)
(582.4KB)
A linear algorithm for the cutting center of a tree
(Elsevier, 1986-11-24)
As a measure of the extent to which the removal of a node disconnects a graph, the cutting number c(v) of a node v in a connected graph G has been defined to be the number of pairs of nodes in different components of G-{v}. ...
(150.6KB)
Linear machinery for morphological distortion
(Elsevier, 1978-10)
In 1917 D'Arcy Thompson reduced the problem of comparing two homologous shapes to the construction and depiction of a mathematical distortion in the plane. Attempts at algorithms for this computation, found mostly in the ...
(1.2MB)
Computation of the correspondence of geographical patterns
(Springer-Verlag; The Regional Science Association, 1965-12)
(439.8KB)
A survey of the theory of hypercube graphs
(Elsevier, 1988)
We present a comprehensive survey of the theory of hypercube graphs. Basic properties related to distance, coloring, domination and genus are reviewed. The properties of the n-cube defined by its subgraphs are considered ...
(735.7KB)