Path algebras: a multiset-theoretic approach

Path algebras: a multiset-theoretic approach

This thesis develops an algebraic theory for path problems such as that of finding the shortest or more generally, the k shortest paths in a network, enumerating elementary paths in a graph. It differs from most earlier work in that the algebraic structure appended to a graph or a network of a path problem is not axiomatically given as a starting point of the theory, but is derived from a novel concept called a 'path space'. This concept is shown to provide a coherent framework for the analysis of path problems, and the development of algebraic methods for solving them. r A number of solution methods are derived, which are analogous tothe classical techniques of solving linear algebraic equations, and the applicability of these methods to different classes of path0problems is examined in detail.The thesis also presents in particular an algebra which is appropriate for the formulation and solution of k-shortest-paths problems. This algebra is a generalization of Giffler's Schedule Algebra for computing all the numerical labels of paths in a network. It is shown formally that these labels can be calculated by using direct methods of linear algebra and an algorithm similar to the long-division procedure of ordinary arithmetic. Such a method is then modified to yield an algorithm for finding k shortest elementary paths in a network.

University of Southampton

Wongseelashote, Ahnont

046b1855-a6c4-4c7f-92c1-1e5cc41bf65d

1976

Wongseelashote, Ahnont

046b1855-a6c4-4c7f-92c1-1e5cc41bf65d

Carré, Bernard A.

f337251f-3fc0-471b-8d91-becd71c07352

Wongseelashote, Ahnont
(1976)
Path algebras: a multiset-theoretic approach.
*University of Southampton, Doctoral Thesis*, 218pp.

Record type:
Thesis
(Doctoral)

## Abstract

This thesis develops an algebraic theory for path problems such as that of finding the shortest or more generally, the k shortest paths in a network, enumerating elementary paths in a graph. It differs from most earlier work in that the algebraic structure appended to a graph or a network of a path problem is not axiomatically given as a starting point of the theory, but is derived from a novel concept called a 'path space'. This concept is shown to provide a coherent framework for the analysis of path problems, and the development of algebraic methods for solving them. r A number of solution methods are derived, which are analogous tothe classical techniques of solving linear algebraic equations, and the applicability of these methods to different classes of path0problems is examined in detail.The thesis also presents in particular an algebra which is appropriate for the formulation and solution of k-shortest-paths problems. This algebra is a generalization of Giffler's Schedule Algebra for computing all the numerical labels of paths in a network. It is shown formally that these labels can be calculated by using direct methods of linear algebra and an algorithm similar to the long-division procedure of ordinary arithmetic. Such a method is then modified to yield an algorithm for finding k shortest elementary paths in a network.

Text

** 77007579
- Version of Record**
## More information

Published date: 1976

## Identifiers

Local EPrints ID: 462388

URI: http://eprints.soton.ac.uk/id/eprint/462388

PURE UUID: 73fe6ca5-f91b-4004-9160-060fdfbd3292

## Catalogue record

Date deposited: 04 Jul 2022 19:06

Last modified: 16 Mar 2024 18:55

## Export record

## Contributors

Author:
Ahnont Wongseelashote

Thesis advisor:
Bernard A. Carré

## Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics