Use this URL to cite or link to this record in EThOS: http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.474433
Title: On optimal and near-optimal algorithms for some computational graph problems
Author: Szwarcfiter, Jayme Luiz
Awarding Body: Newcastle University
Current Institution: University of Newcastle upon Tyne
Date of Award: 1975
Availability of Full Text:
Access through EThOS:
Access through Institution:
Abstract:
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 algorithms are based on recursive procedures using depth-first search. The efficiency of each algorithm is derived and it can be concluded that the majority of the proposed algorithms are either optimal and near-optimal within a constant factor. The efficiency of the algorithms is measured by the time and space requirements for their implementation.
Supervisor: Not available Sponsor: Conselho Nacional de Pesquisas, Brazil ; Universidade Federal do Rio de Janeiro, Brazil
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.474433  DOI: Not available
Share: