No label defined (Q3972663)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 16016
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 16016 |
Statements
25 June 1992
0 references
path algebra
0 references
path problems
0 references
directed graph
0 references
0.91102797
0 references
0.8906101
0 references
0.88702095
0 references
0.8789288
0 references
0.85847896
0 references
0.8561666
0 references
0.85491073
0 references
0.85368526
0 references
This paper considers path problems for oriented graphs. As examples of such problems we can take: finding the shortest path with two specified nodes as endvertices, listing all elementary paths, finding the most reliable path. Such problems can be generally formulated and solved by introducing a suitable algebraic structure called the path algebra. This paper gives some new examples of the path algebra and shows how these examples can be interpreted as meaningful path problems for oriented graphs. As examples of such problems we can mention: give the length and name of one shortest path from vertex \(a\) to vertex \(b\), or reliability and name of the most reliable path from \(a\) to \(b\), both for all ordered pairs of vertices \(a\), \(b\). [For the entire collection see Zbl 0713.00016.]
0 references
