scientific article; zbMATH DE number 16016
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.]
- Some results dealing with the algebraic approach to path problems in graphs
- Composite path algebras for solving path problems in graphs.
- Two results on the path algebra of a directed graph
- Two new characterizations of path graphs
- scientific article; zbMATH DE number 1135782
- Path decompositions of digraphs and their applications to Weyl algebra
- scientific article; zbMATH DE number 4110712
- Further results on pathos graphs and related graph equations
- New results on path-decompositions and their down-links
- The algebraic Monge property and path problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972663)
