Graphs and Matroids Weighted in a Bounded Incline Algebra
Joint Authors
Source
Issue
Vol. 2014, Issue 2014 (31 Dec. 2014), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2014-07-13
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Medicine
Information Technology and Computer Science
Abstract EN
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.
American Psychological Association (APA)
Lu, Ling-Xia& Zhang, Bei. 2014. Graphs and Matroids Weighted in a Bounded Incline Algebra. The Scientific World Journal،Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-1051573
Modern Language Association (MLA)
Lu, Ling-Xia& Zhang, Bei. Graphs and Matroids Weighted in a Bounded Incline Algebra. The Scientific World Journal No. 2014 (2014), pp.1-4.
https://search.emarefa.net/detail/BIM-1051573
American Medical Association (AMA)
Lu, Ling-Xia& Zhang, Bei. Graphs and Matroids Weighted in a Bounded Incline Algebra. The Scientific World Journal. 2014. Vol. 2014, no. 2014, pp.1-4.
https://search.emarefa.net/detail/BIM-1051573
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1051573
