Now showing items 1-3 of 3
A fast algorithm to determine minimality of strongly connected digraphs
In this thesis, we consider the following problem: Given a strongly connected digraph G = (V, E), where V is the set of vertices and E is the set of edges , "is it a minimal strong connected digraph?". A reducible edges e ...
Spatial harvest scheduling in the Southeastern United States
The use of spatial harvest scheduling processes has increased over the past 15 years due to regulatory and voluntary programs that affect the spatial and temporal arrangement of management activities across a landscape. ...
Estimating the demand for and value of recreation access to national forest wilderness
The Travel Cost Method (TCM) is the dominant method for recreation demand analysis. The number of trips to a site is assumed to relate to travel cost, travel time and other demographics. One disadvantage of the conventional ...