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

Descripción completa

Detalles Bibliográficos
Autores principales: Lu, Ling-Xia, Zhang, Bei
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Hindawi Publishing Corporation 2014
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4122196/
https://www.ncbi.nlm.nih.gov/pubmed/25126607
http://dx.doi.org/10.1155/2014/912715

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4122196/
https://www.ncbi.nlm.nih.gov/pubmed/25126607
http://dx.doi.org/10.1155/2014/912715

Ejemplares similares