On optimal and near-optimal algorithms for some computational graph problems
Some computational graph problems are considered in this thesis and algorithms for solving these problems are described in detail. The problems can be divided into three main classes, namely, problems involving partially ordered sets, finding cycles in graphs, and shortest path problems. Most of the...
| Main Author: | |
|---|---|
| Published: |
University of Newcastle Upon Tyne
1975
|
| Subjects: | |
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.474433 |