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...
Saved in:
| Main Authors: | Ling-Xia Lu, Bei Zhang |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/912715 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Matroidal Structure of Rough Sets from the Viewpoint of Graph Theory
by: Jianguo Tang, et al.
Published: (2012-01-01) -
Orthogonal matroids over tracts
by: Tong Jin, et al.
Published: (2025-01-01) -
Enumerating Matroids and Linear Spaces
by: Kwan, Matthew, et al.
Published: (2023-02-01) -
Covering-Based Rough Sets on Eulerian Matroids
by: Bin Yang, et al.
Published: (2013-01-01) -
Matroidal Structure of Generalized Rough Sets Based on Tolerance Relations
by: Hui Li, et al.
Published: (2014-01-01)