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...

Full description

Saved in:
Bibliographic Details
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!
_version_ 1849435345378082816
author Ling-Xia Lu
Bei Zhang
author_facet Ling-Xia Lu
Bei Zhang
author_sort Ling-Xia Lu
collection DOAJ
description 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 and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.
format Article
id doaj-art-e530ebb4262b45e98184e0beb00be44d
institution Kabale University
issn 2356-6140
1537-744X
language English
publishDate 2014-01-01
publisher Wiley
record_format Article
series The Scientific World Journal
spelling doaj-art-e530ebb4262b45e98184e0beb00be44d2025-08-20T03:26:20ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/912715912715Graphs and Matroids Weighted in a Bounded Incline AlgebraLing-Xia Lu0Bei Zhang1School of Mathematics and Science, Shijiazhuang University of Economics, Shijiazhuang 050031, ChinaSchool of Science, Hebei University of Science and Technology, Shijiazhuang 050018, ChinaFirstly, 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 and related algorithms are given. Secondly, for a matroid weighted in a linear matroid, the maximum independent set problem is studied.http://dx.doi.org/10.1155/2014/912715
spellingShingle Ling-Xia Lu
Bei Zhang
Graphs and Matroids Weighted in a Bounded Incline Algebra
The Scientific World Journal
title Graphs and Matroids Weighted in a Bounded Incline Algebra
title_full Graphs and Matroids Weighted in a Bounded Incline Algebra
title_fullStr Graphs and Matroids Weighted in a Bounded Incline Algebra
title_full_unstemmed Graphs and Matroids Weighted in a Bounded Incline Algebra
title_short Graphs and Matroids Weighted in a Bounded Incline Algebra
title_sort graphs and matroids weighted in a bounded incline algebra
url http://dx.doi.org/10.1155/2014/912715
work_keys_str_mv AT lingxialu graphsandmatroidsweightedinaboundedinclinealgebra
AT beizhang graphsandmatroidsweightedinaboundedinclinealgebra