Graphs and Matroids Weighted in a Bounded Incline Algebra
Firstly, for a graph weighted in a bounded incline algebra (or called a dioid), a longest path problem (LPP, for short) is presented, which can be considered the uniform approach to the famous shortest path problem, the widest path problem, and the most reliable path problem. The solutions for LPP a...
Main Authors: | Ling-Xia Lu, Bei Zhang |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | The Scientific World Journal |
Online Access: | http://dx.doi.org/10.1155/2014/912715 |
Similar Items
-
Matroid Relationships:Matroids for Algebraic Topology
by: Estill, Charles
Published: (2013) -
Algebraic number-theoretic properties of graph and matroid polynomials
by: Bohn, Adam Stuart
Published: (2014) -
Densities in graphs and matroids
by: Kannan, Lavanya
Published: (2010) -
Algebraic problems in matroid theory
by: Sarmiento-Lopez, X. I.
Published: (1998) -
Matroids from Graphs and Directed Graphs
by: Matthews, L. R.
Published: (1977)