scientific article; zbMATH DE number 3795354

MaRDI QIDQ4741699zbMATH OpenFDO

Authors Bernd Mahr

Publication date 1982

Full work available at URL https://eudml.org/doc/92166

zbMATH Keywords

algebraic complexityindependencelower boundspath problemssemi-ringsstraightline programs

Mathematics Subject Classification ID

Semirings (16Y60) Analysis of algorithms and problem complexity (68Q25)

Cites work

• A Shortest Path Algorithm for Edge-Sparse Graphs
• A Shortest-Path Algorithm with Expected Time $O(n^2 \log n\log ^ * n)$
• Algebraic structures for transitive closure
• Efficient Algorithms for Shortest Paths in Sparse Networks
• scientific article; zbMATH DE number 3703986 (Why is no real title available?)
• scientific article; zbMATH DE number 3711407 (Why is no real title available?)
• scientific article; zbMATH DE number 3711960 (Why is no real title available?)
• scientific article; zbMATH DE number 3761404 (Why is no real title available?)
• scientific article; zbMATH DE number 3458413 (Why is no real title available?)
• scientific article; zbMATH DE number 3485819 (Why is no real title available?)
• scientific article; zbMATH DE number 3497806 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3557221 (Why is no real title available?)
• scientific article; zbMATH DE number 3431974 (Why is no real title available?)
• scientific article; zbMATH DE number 3387374 (Why is no real title available?)
• Linear and combinatorial optimization in ordered algebraic structures
• New Bounds on the Complexity of the Shortest Path Problem
• On Finding and Updating Spanning Trees and Shortest Paths
• Shortest-path algorithms: Taxonomy and annotation
• Shortest-path problem is not harder than matrix multiplication
• The Power of Negative Thinking in Multiplying Boolean Matrices

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4741699)