Search Results

Abstract of a paper given before an annual meeting of the American Mathematical Society.

Application of fractal geometry to geography.

In this paper, a methodology to classify terrain is presented. The taxonomy is devised using a terrain template based on evidence from topographic maps, and the resulting classes are characterized as steep, intermediate, ...

Updated reprint of classic textbook. This is the book that was used by John Kolars in teaching his last round of Geography 101 at The University of Michigan, 1986-1989.

Please read the attached file for an abstract and for a link to the full text for the reader to use via a participating library or other institutions (for a free copy).

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}. ...

The boolean distance between two points x and y of a connected graph G is defined as the set of all points on all paths joining x and y in G (O if X = y). It is determined in terms of the block-cutpoint graph of G, and ...

Workbook used in support of computer training at conferences.