Graphs and Matroids Weighted in a Bounded Incline Algebra

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

Bibliographic Details
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
id doaj-e530ebb4262b45e98184e0beb00be44d
record_format Article
spelling doaj-e530ebb4262b45e98184e0beb00be44d2020-11-24T21:22:37ZengHindawi LimitedThe 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
collection DOAJ
language English
format Article
sources DOAJ
author Ling-Xia Lu
Bei Zhang
spellingShingle Ling-Xia Lu
Bei Zhang
Graphs and Matroids Weighted in a Bounded Incline Algebra
The Scientific World Journal
author_facet Ling-Xia Lu
Bei Zhang
author_sort Ling-Xia Lu
title Graphs and Matroids Weighted in a Bounded Incline Algebra
title_short 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_sort graphs and matroids weighted in a bounded incline algebra
publisher Hindawi Limited
series The Scientific World Journal
issn 2356-6140
1537-744X
publishDate 2014-01-01
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.
url http://dx.doi.org/10.1155/2014/912715
work_keys_str_mv AT lingxialu graphsandmatroidsweightedinaboundedinclinealgebra
AT beizhang graphsandmatroidsweightedinaboundedinclinealgebra
_version_ 1725995002864074752

Similar Items