The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Jeffrey L. Kennington / rank
Normal rank
 
Property / author
 
Property / author: Jeffrey L. Kennington / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 360 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shortest Route Through a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path algorithms: Taxonomy and annotation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the partitioning shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvements for the thresh X2 shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Appraisal of Some Shortest-Path Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path methods: A unifying approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Polynomial Shortest Path Algorithms and Their Computational Attributes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4742310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968759 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2718910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parallel shortest path algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Shortest Route between Two Points in a Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4217266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5679703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3773322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3730336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01299142 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049802874 / rank
 
Normal rank

Latest revision as of 08:30, 30 July 2024

scientific article
Language Label Description Also known as
English
The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm
scientific article

    Statements

    The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (English)
    0 references
    0 references
    0 references
    0 references
    30 August 1993
    0 references
    shortest-path algorithms
    0 references
    parallel algorithm
    0 references
    heuristics
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references